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

Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens

Vladimir Kolesnikov

Published Jan 1, 2010• 39 citations
Publisher
DOI
10.1007/978-3-642-11799-2_20

Related papers

Efficient Committed Oblivious Transfer of Bit Strings

Mehmet Sabır Kiraz, Berry Schoenmakers, José Villegas

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

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

Seung Geol Choi, Jonathan I. Katz, Dominique Schröder +2 more

Lecture notes in computer science•Jan 1, 2014•19 citations

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

Seung Geol Choi, Jonathan I. Katz, Dominique Schröder +2 more

Journal of Cryptology•Mar 23, 2018•2 citations

Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens

Nico Döttling, Thilo Mie, Jörn Müller‐Quade +1 more

Lecture notes in computer science•Jan 1, 2013•20 citations

Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens

Rafael Dowsley, Jörn Müuller-Quade, Tobias Nilges

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

From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions

Nico Döttling, Daniel Kraschewski, Jörn Müller‐Quade +1 more

Universally composable multi-party computation is impossible without setup assumptions. Motivated by the ubiquitous use of secure hardware in many real world security applications, Katz (EUROCRYPT 2007) proposed a model of tamper-proof hardware as a UC-setup assumption. An important aspect of this model is whether the hardware token is allowed to hold a state or not. Real world examples of tamper-proof hardware that can hold a state are expensive hardware security modules commonly used in mainframes. Stateless, or resettable hardware tokens model cheaper devices such as smartcards, where an adversarial user can cut off the power supply, thus resetting the card’s internal state. A natural question is how the stateful and the resettable hardware model compare in their cryptographic power, given that either the receiver or the sender of the token (and thus the token itself) might be malicious. In this work we show that any UC-functionality that can be implemented by a protocol using a single untrusted stateful hardware token can likewise be implemented using a single untrusted resettable hardware token, assuming only the existence of one-way functions. We present two compilers that transform UC-secure protocols in the stateful hardware model into UC-secure protocols in the resettable hardware model. The first compiler can be proven secure assuming merely the existence of one-way functions. However, it (necessarily) makes use of computationally rather expensive non-black-box techniques. We provide an alternative second compiler that replaces the expensive non-black-box component of the first compiler by few additional seed OTs. While this second compiler introduces the seed OTs as additional setup assumptions, it is computationally very efficient.

Lecture notes in computer science•Jan 1, 2015•7 citations
Universally composable multi-party computation is impossible without setup assumptions. Motivated by the ubiquitous use of secure hardware in many real world security applications, Katz (EUROCRYPT 2007) proposed a model of tamper-proof hardware as a UC-setup assumption. An important aspect of this model is whether the hardware token is allowed to hold a state or not. Real world examples of tamper-proof hardware that can hold a state are expensive hardware security modules commonly used in mainframes. Stateless, or resettable hardware tokens model cheaper devices such as smartcards, where an adversarial user can cut off the power supply, thus resetting the card’s internal state. A natural question is how the stateful and the resettable hardware model compare in their cryptographic power, given that either the receiver or the sender of the token (and thus the token itself) might be malicious. In this work we show that any UC-functionality that can be implemented by a protocol using a single untrusted stateful hardware token can likewise be implemented using a single untrusted resettable hardware token, assuming only the existence of one-way functions. We present two compilers that transform UC-secure protocols in the stateful hardware model into UC-secure protocols in the resettable hardware model. The first compiler can be proven secure assuming merely the existence of one-way functions. However, it (necessarily) makes use of computationally rather expensive non-black-box techniques. We provide an alternative second compiler that replaces the expensive non-black-box component of the first compiler by few additional seed OTs. While this second compiler introduces the seed OTs as additional setup assumptions, it is computationally very efficient.