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

Springer eBooks

Robuster Combiners for Oblivious Transfer

Remo Meier, Bartosz Przydatek, Jürg Wullschleger

Published May 16, 2007• 41 citations
Publisher
DOI
10.1007/978-3-540-70936-7_22

Related papers

On Robust Combiners for Oblivious Transfer and Other Primitives

Danny Harnik, Joe Kilian, Moni Naor +2 more

Lecture notes in computer science•Jan 1, 2005•129 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

Robust t-out-of-n oblivious transfer mechanism based on CRT

Chin‐Chen Chang, Jung-San Lee

Journal of Network and Computer Applications•Mar 29, 2008•18 citations

Secret function sharing schernes and their applications to the oblivious transfer

Yohei Kawamoto, H. Yamamoto

Secret function sharing schemes (SFSS), .which are first studied in (l), are defined and analyzed information theoretically. They are also extended to ramp schemes in the same way as (2). Furthermore, it is shown that an unconditionally secure distributed oblivious transfer (OT) protocol is constructed by combining the SFSS with multi-groups secret sharing scheme (MG-SSS) (3) and the protocol is more robust against collusion attacks than that shown in (4).

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•4 citations

Extending Oblivious Transfer Efficiently

Enrique Larraia

Lecture notes in computer science•Jan 1, 2015•10 citations

Oblivious Transfer and Applications

Carmit Hazay, Yehuda Lindell

Information security and cryptography•Jan 1, 2010•0 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.