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

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

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

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

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

Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption.

Eduard Hauck, Julian Loss

•Jan 1, 2017•17 citations