CryptoDB

Paper: Direct Reduction of String (1,2)-OT to Rabin's OT

Authors: Kaoru Kurosawa Takeshi Koshiba URL: http://eprint.iacr.org/2007/046 Search ePrint Search Google 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.
BibTeX
@misc{eprint-2007-13328,
title={Direct Reduction of String (1,2)-OT to Rabin's OT},
booktitle={IACR Eprint archive},
keywords={foundations / Oblivious Transfer, Reduction},
url={http://eprint.iacr.org/2007/046},
note={ koshiba@tcs.ics.saitama-u.ac.jp 13603 received 13 Feb 2007, last revised 31 Mar 2007},
author={Kaoru Kurosawa and Takeshi Koshiba},
year=2007
}