Welcome to the resource topic for 2007/065
Title:
How to Derive Lower Bound on Oblivious Transfer Reduction
Authors: Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba
Abstract:Suppose that we are given an ideal oblivious transfer protocol (OT). We wish to construct a larger OT by using the above OT as a blackbox. Then how many instances of the given ideal OT should be invoked ? For this problem, some lower bounds were derived using entropy. In this paper, we show more tight lower bounds by using combinatorial techniques. Roughly speaking, our lower bounds are two times larger than the previous bounds.
ePrint: https://eprint.iacr.org/2007/065
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 .