DocumentCode
1232631
Title
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions
Author
Kurosawa, Kaoru ; Kishimoto, Wataru ; Koshiba, Takeshi
Author_Institution
Dept. of Comput. & Inf. Sci., Ibaraki Univ., Hitachi
Volume
54
Issue
6
fYear
2008
fDate
6/1/2008 12:00:00 AM
Firstpage
2566
Lastpage
2571
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.
Keywords
combinatorial mathematics; cryptographic protocols; private key cryptography; OT two-party protocol; combinatorial approach; lower bounds; oblivious transfer reductions; perfectly secure OT reductions; secret bits; Cryptographic protocols; Cryptography; Entropy; Helium; Informatics; Information security; Mathematics; Privacy; Combinatorial approach; lower bound; oblivious transfer; reduction;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2008.921704
Filename
4529281
Link To Document