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

Journal of Cryptology

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

Seung Geol Choi, Jonathan I. Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou

Published Mar 23, 2018• 2 citations
Publisher
DOI
10.1007/s00145-018-9288-x

Related papers

(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

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 Two-Party Computation Using a Minimal Number of Stateless Tokens.

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

•Jan 1, 2011•4 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Lecture notes in computer science•Jan 1, 2004•59 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Springer eBooks•Jan 26, 2007•2 citations

Essentially Optimal Universally Composable Oblivious Transfer

Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi

Lecture notes in computer science•Jan 1, 2009•27 citations