## CryptoDB

### Paper: How to Derive Lower Bound on Oblivious Transfer Reduction

Authors: Kaoru Kurosawa Wataru Kishimoto Takeshi Koshiba URL: http://eprint.iacr.org/2007/065 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13347,
title={How to Derive Lower Bound on Oblivious Transfer Reduction},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols /},
url={http://eprint.iacr.org/2007/065},
note={ kurosawa@mx.ibaraki.ac.jp 13585 received 20 Feb 2007, last revised 13 Mar 2007},
author={Kaoru Kurosawa and Wataru Kishimoto and Takeshi Koshiba},
year=2007
}