CryptoDB
Wataru Kishimoto
Affiliation: Chiba University
Publications
Year
Venue
Title
2007
EPRINT
How to Derive Lower Bound on Oblivious Transfer Reduction
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.
Coauthors
- Takeshi Koshiba (1)
- Kaoru Kurosawa (1)