Welcome to the resource topic for 2007/046
Title:
Direct Reduction of String (1,2)-OT to Rabin’s OT
Authors: Kaoru Kurosawa, 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.
ePrint: https://eprint.iacr.org/2007/046
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .