Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Lower Bounds for Oblivious Transfer Reductions

Yevgeniy Dodis, Silvio M. Micali

Published Jan 1, 1999• 46 citations
Publisher
DOI
10.1007/3-540-48910-x_4

Related papers

On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

Severin Winkler, Jürg Wullschleger

Lecture notes in computer science•Jan 1, 2010•25 citations

Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions

Payman Mohassel, Salman Niksefat

Lecture notes in computer science•Jan 1, 2012•7 citations

Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

Claude Crépeau, George Savvides

Lecture notes in computer science•Jan 1, 2006•33 citations

How to Derive Lower Bound on Oblivious Transfer Reduction.

Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba

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.

•Jan 1, 2007•0 citations

Realizations of oblivious transfer with reduced assumptions

K.Y. Cheong

•Jan 1, 2009•0 citations

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

Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba

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.

IEEE Transactions on Information Theory•May 29, 2008•6 citations
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.