k out of n Oblivious Transfer without Random Oracles

Wakaha Ogata, Ryota Sasahara

Kaoru Kurosawa, Ryo Nojima

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

Bernardo David, Rafael Dowsley

Himanshu Tyagi, Shun Watanabe

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.