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 Transfers and Privacy Amplification

Gilles Brassard, Claude Crépeau

Published Jan 1, 1997• 35 citations
Publisher
DOI
10.1007/3-540-69053-0_23

Related papers

Oblivious Transfers and Privacy Amplification

Gilles Brassard, Claude Crépeau, Stefan Wolf

Journal of Cryptology•Mar 5, 2003•59 citations

Oblivious-Transfer Amplification

Jürg Wullschleger

Lecture notes in computer science•Jan 1, 2007•76 citations

Oblivious transfer with timed-release receiver’s privacy

Xu Ma, Lingling Xu, Fangguo Zhang

Journal of Systems and Software•Nov 22, 2010•16 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

Weakening Security Assumptions and Oblivious Transfer

Claude Crépeau, Joe Kilian

Lecture notes in computer science•Jan 1, 1990•43 citations

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.

Samuel Ranellucci, Alain Tapp

We construct a very efficient protocol for constant round Two-Party Secure Function Evaluation based on general assumptions. We define and instantiate a leaky variant of Generalized Oblivious Transfer based on Oblivious Transfer and Commitment Schemes. The concepts of Garbling Schemes, Leaky Generalized Oblivious Transfer and Privacy Amplification are combined using the Cut-and-Choose paradigm to obtain the final protocol. Our solution is proven secure in the Universal Composability Paradigm.

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