Paper 2005/279 Original: eprint.iacr.org/2005/279 ↗
Efficient reduction of 1 out of $n$ oblivious transfers in random oracle model
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-08-25: last updated
- 2005-08-25: published
- Short URL
- https://ia.cr/2005/279
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}