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• 40 citations
Publisher
DOI
10.1007/978-3-642-11799-2_20

Related papers

On Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware.

Maria Dubovitskaya, Alessandra Scafuro, Ivan Visconti

•Jan 1, 2010•7 citations

Efficient Committed Oblivious Transfer of Bit Strings

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

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

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

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

•Jan 1, 2013•0 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•18 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•21 citations