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.