Lower Bounds for Oblivious Transfer Reductions

We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an information-theoretically secure reduction, a 1-out-of-N Oblivious Transfer of strings of length L. Our bound is tight in many significant cases. We also prove the first non-trivial lower bound for the number of random bits needed to implement such a reduction whenever the receiver sends no messages to the sender. This bound is also tight in many significant cases.

• Type: Conference
• Year: 1999
• Where: EUROCRYPT
• Authors: Yevgeniy Dodis, Silvio Micali
• Keywords: 1-out-of-n Oblivious Transfer, Cryptology, EUROCRYPT 1999, Non-trivial Lower Bound, Significant Cases