© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

K out of n oblivious transfer without random oracles

Wakaha Ogata, Ryota Sasahara

Published Jan 1, 2004• 8 citations

Related papers

k out of n Oblivious Transfer without Random Oracles

Wakaha Ogata

•Jan 1, 2004•0 citations

Simple Adaptive Oblivious Transfer without Random Oracle

Kaoru Kurosawa, Ryo Nojima

Lecture notes in computer science•Jan 1, 2009•31 citations

Endemic Oblivious Transfer via Random Oracles, Revisited

Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou +1 more

Lecture notes in computer science•Jan 1, 2023•1 citation

Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model

Bernardo David, Rafael Dowsley

Lecture notes in computer science•Jan 1, 2020•4 citations

Oblivious Transfer from Correlated Randomness

Himanshu Tyagi, Shun Watanabe

Cambridge University Press eBooks•Mar 23, 2023•0 citations

reduction of 1 out of n oblivious transfers in random oracle model

Bao Li, Hongda Li, Guangwu Xu +1 more

We first present a protocol which reduces 1-out-of-n oblivious transfer OT m to 1out-of-n oblivious transfer OT k for n > 2 in random oracle model, and show that the protocol is secure against malicious sender and semi-honest receiver. Then, by employing a cut-and-choose technique, we obtain a variant of the basic protocol which is secure against a malicious receiver.

•Jan 1, 2003•0 citations