© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Lecture notes in computer science

Lower Bounds for Oblivious Transfer Reductions

Yevgeniy Dodis, Silvio M. Micali

Published Jan 1, 1999• 49 citations

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•26 citations

Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions

Payman Mohassel, Salman Niksefat

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

On the efficiency of classical and quantum oblivious transfer reductions

Severin Winkler

•Jan 1, 2010•0 citations

Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

Claude Crépeau, George Savvides

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

Optimal reductions between oblivious transfers using interactive hashing

Claude Crépeau, George Savvides

•Jan 1, 2006•0 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