Paper 2007/046 Original: eprint.iacr.org/2007/046 ↗
Direct Reduction of String (1,2)-OT to Rabin's OT
Abstract
It is known that string (1,2)-OT and Rabin's OT are equivalent. However, two steps are required to construct a string $(1,2)$-OT from Rabin's OT. The first step is a construction of a bit (1,2)-OT from Rabin's OT, and the second step is a construction of a string $(1,2)$-OT from the bit (1,2)-OT. No direct reduction is known. In this paper, we show a direct reduction of string (1,2)-OT to Rabin's OT by using a deterministic randomness extractor. Our reduction is much more efficient than the previous two-step reduction.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2007-03-31: last updated
- 2007-02-14: published
- Short URL
- https://ia.cr/2007/046
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/046,
author = {Kaoru Kurosawa and Takeshi Koshiba},
title = {Direct Reduction of String (1,2)-OT to Rabin's OT},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/046},
year = {2007},
url = {https://eprint.iacr.org/2007/046}
}