CryptoDB
Efficient reduction of 1 out of $n$ oblivious transfers in random oracle model
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12613, title={Efficient reduction of 1 out of $n$ oblivious transfers in random oracle model}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / oblivious transfer, secure reduction}, url={http://eprint.iacr.org/2005/279}, note={ lb@is.ac.cn 13011 received 16 Aug 2005}, author={Bao Li and Hongda Li and Guangwu Xu and Haixia Xu}, year=2005 }