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

Kaoru Kurosawa; Takeshi Koshiba

Paper 2007/046

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

Kaoru Kurosawa and Takeshi Koshiba

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): PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: Oblivious Transfer Reduction
Contact author(s): koshiba @ tcs ics saitama-u ac jp
History: 2007-03-31: revised; 2007-02-14: received; See all versions
Short URL: https://ia.cr/2007/046
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2007/046}},
      url = {https://eprint.iacr.org/2007/046}
}