Cryptology ePrint Archive: Report 2005/279

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

Bao Li and Hongda Li and Guangwu Xu and Haixia Xu

Abstract: We first present a protocol which reduces 1-out-of-$n$ oblivious transfer OT$_l^m$ to 1-out-of-$n$ oblivious transfer OT$_m^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.

Category / Keywords: cryptographic protocols / oblivious transfer, secure reduction

Date: received 16 Aug 2005

Contact author: lb at is ac cn

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050825:073506 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]