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

On Robust Combiners for Oblivious Transfer and Other Primitives

Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen

Published Jan 1, 2005• 129 citations
Publisher
DOI
10.1007/11426639_6

Related papers

Robuster Combiners for Oblivious Transfer

Remo Meier, Bartosz Przydatek, Jürg Wullschleger

Springer eBooks•May 16, 2007•41 citations

Generalized Robust Combiners for Oblivious Transfer

Ganugula Umadevi, Sarat C. Addepalli, Kannan Srinathan

A robust combiner for a cryptographic primitive gives a secure implementation of the primitive when at least some of the input candidates are secure. Such constructions provide robustness against insecure implementations and incorrect assumptions underlying the candidate schemes. Robust combiners are useful tools for ensuring better security in applied cryptography. Combiners from the perspective of threshold schemes have been previously studied. However, such threshold schemes typically fail to capture all possible scenarios. In this paper, we characterize the possibility of a transparent black-box combiner for oblivious transfer (OT), given an access structure over the candidate implementations. We also propose a circuit-based framework for the construction of such combiners, and hence reduce the problem of optimal OT combiners to circuit optimization.

International Conference on Availability, Reliability and Security (ARES)•Jan 1, 2009•0 citations

Supersingular Isogeny Oblivious Transfer (SIOT)

Paulo S. L. M. Barreto, Anderson C. A. Nascimento, Gláucio Oliveira +1 more

We present an oblivious transfer (OT) protocol that combines the OT scheme of Chou and Orlandi together with thesupersingular isogeny Diffie-Hellman (SIDH) primitive of De Feo, Jao, and Plût. Our construction is a candidate for post-quantum secure OT and demonstrates that SIDH naturally supports OT functionality. We consider the protocol in the simplest configuration of $\binom{2}{1}$-OT and analyze the protocol to verify its security.

arXiv:1805.06589•May 17, 2018•3 citations

Error-Tolerant Combiners for Oblivious Primitives

Bartosz Przydatek, Jürg Wullschleger

Lecture notes in computer science•Aug 12, 2008•12 citations

On Robust Combiners for Private Information Retrieval and Other Primitives

Remo Meier, Bartosz Przydatek

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

Anonymous Oblivious Transfer

Mueller-Quade, J., Hideki Imai

In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi party protocols with {\em anonymous oblivious transfer}. No assumption about possible collusions of cheaters or disruptors have to be made. Furthermore we shortly discuss how to realize anonymous oblivious transfer with oblivious broadcast or by quantum cryptography. The protocol of anonymous oblivious transfer was inspired by a quantum protocol: the anonymous quantum channel.

arXiv:cs/0011004•Nov 4, 2000•6 citations
A robust combiner for a cryptographic primitive gives a secure implementation of the primitive when at least some of the input candidates are secure. Such constructions provide robustness against insecure implementations and incorrect assumptions underlying the candidate schemes. Robust combiners are useful tools for ensuring better security in applied cryptography. Combiners from the perspective of threshold schemes have been previously studied. However, such threshold schemes typically fail to capture all possible scenarios. In this paper, we characterize the possibility of a transparent black-box combiner for oblivious transfer (OT), given an access structure over the candidate implementations. We also propose a circuit-based framework for the construction of such combiners, and hence reduce the problem of optimal OT combiners to circuit optimization.
We present an oblivious transfer (OT) protocol that combines the OT scheme of Chou and Orlandi together with thesupersingular isogeny Diffie-Hellman (SIDH) primitive of De Feo, Jao, and Plût. Our construction is a candidate for post-quantum secure OT and demonstrates that SIDH naturally supports OT functionality. We consider the protocol in the simplest configuration of (21)\binom{2}{1}(12​)-OT and analyze the protocol to verify its security.
In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi party protocols with {\em anonymous oblivious transfer}. No assumption about possible collusions of cheaters or disruptors have to be made. Furthermore we shortly discuss how to realize anonymous oblivious transfer with oblivious broadcast or by quantum cryptography. The protocol of anonymous oblivious transfer was inspired by a quantum protocol: the anonymous quantum channel.