Paper 2005/279

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

Bao Li, Hongda Li, Guangwu Xu, and Haixia Xu

Abstract

We first present a protocol which reduces 1-out-of-n oblivious transfer OTlm to 1-out-of-n oblivious transfer OTmk 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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
oblivious transfersecure reduction
Contact author(s)
lb @ is ac cn
History
2005-08-25: received
Short URL
https://ia.cr/2005/279
License
Creative Commons Attribution
CC BY

BibTeX 

@misc{cryptoeprint:2005/279,
      author = {Bao Li and Hongda Li and Guangwu Xu and Haixia Xu},
      title = {Efficient reduction of 1 out of $n$ oblivious transfers in random oracle model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/279},
      year = {2005},
      url = {https://eprint.iacr.org/2005/279}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.