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

Oblivious-Transfer Amplification

Jürg Wullschleger

Published Jan 1, 2007• 76 citations
Publisher
DOI
10.1007/978-3-540-72540-4_32

Related papers

Oblivious Transfers and Privacy Amplification

Gilles Brassard, Claude Crépeau

Lecture notes in computer science•Jan 1, 1997•35 citations

Oblivious Transfers and Privacy Amplification

Gilles Brassard, Claude Crépeau, Stefan Wolf

Journal of Cryptology•Mar 5, 2003•59 citations

Oblivious transfer with extractors

Boting Yang

Reductions among oblivious transfers have a long history in cryptography. This paper describes a 21-OT~k protocol that can be reduced to a single execution of UOT by using privacy amplification with extractors. An extractor allows to efficiently isolate the randomness of some source into virtually-random bits, using a small number of perfectly-random bits as a catalyst. With extractors, less information is transmitted and the leaked information is at most 2~(-n~(-1/2-o(1))) bits. The conditions under which the protocol is unconditionally secure are investigated.

Journal of Xidian University•Jan 1, 2004•0 citations

Oblivious Transfer and Applications

Carmit Hazay, Yehuda Lindell

Information security and cryptography•Jan 1, 2010•0 citations

Oblivious Transfer

Kai Chen, Qiang Yang

Cambridge University Press eBooks•Oct 26, 2023•0 citations

Oblivious-Transfer Amplification

Jürg Wullschleger

Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions oblivious transfer can be based on. The results in our thesis are threefold. First, we present a protocol that implements oblivious transfer from a weakened oblivious transfer called universal oblivious transfer, where one of the two players may get additional information. Our reduction is about twice as efficient as previous results. Weak oblivious transfer is an even weaker form of oblivious transfer, where both players may obtain additional information about the other player's input, and where the output can contain errors. We give a new, weaker definition of weak oblivious transfer, as well as new reductions with a more detailed analysis. Finally, we carry over our results to the computational setting and show how a weak oblivious transfer that is sometimes incorrect and only mildly secure against computationally bounded adversaries can be strengthened.

arXiv:cs/0608076•Aug 18, 2006•15 citations
Reductions among oblivious transfers have a long history in cryptography. This paper describes a 21-OT~k protocol that can be reduced to a single execution of UOT by using privacy amplification with extractors. An extractor allows to efficiently isolate the randomness of some source into virtually-random bits, using a small number of perfectly-random bits as a catalyst. With extractors, less information is transmitted and the leaked information is at most 2~(-n~(-1/2-o(1))) bits. The conditions under which the protocol is unconditionally secure are investigated.
Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions oblivious transfer can be based on. The results in our thesis are threefold. First, we present a protocol that implements oblivious transfer from a weakened oblivious transfer called universal oblivious transfer, where one of the two players may get additional information. Our reduction is about twice as efficient as previous results. Weak oblivious transfer is an even weaker form of oblivious transfer, where both players may obtain additional information about the other player's input, and where the output can contain errors. We give a new, weaker definition of weak oblivious transfer, as well as new reductions with a more detailed analysis. Finally, we carry over our results to the computational setting and show how a weak oblivious transfer that is sometimes incorrect and only mildly secure against computationally bounded adversaries can be strengthened.