Cryptology ePrint Archive: Report 2007/065

How to Derive Lower Bound on Oblivious Transfer Reduction

Kaoru Kurosawa and Wataru Kishimoto and 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.

Category / Keywords: cryptographic protocols /

Date: received 20 Feb 2007, last revised 13 Mar 2007

Contact author: kurosawa at mx ibaraki ac jp

Available formats: PDF | BibTeX Citation

Version: 20070313:125152 (All versions of this report)

Discussion forum: Show discussion | Start new discussion