A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions

Authors:
K. Kurosawa;W. Kishimoto;T. Koshiba
Affiliations:
Dept. of Comput. & Inf. Sci., Ibaraki Univ., Hitachi;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 2

Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
On the efficiency of classical and quantum oblivious transfer reductions

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology

Quantified Score

Hi-index	754.84

Visualization

Abstract

Consider the scenario where we are given an ideal functionality of oblivious transfer (OT), and we wish to construct a larger OT by invoking the above functionality as a black box. How many invocations of an ideal OT functionality are necessary? In tackling this problem, some lower bounds were derived using entropy previously. In this paper, we manage to achieve tighter lower bounds by employing a combinatorial approach. This new approach yields lower bounds which are two times larger than the existing bounds.