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

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

Published Jan 1, 2011• 4 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

•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

(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

Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model

Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky +1 more

International Cryptology Conference•Jan 1, 2017•2 citations

Universally-Composable Two-Party Computation in Two Rounds

Omer Horvitz, Jonathan I. Katz

Springer eBooks•Aug 9, 2007•60 citations

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Ran Canetti, Eyal Kushilevitz Z, Yehuda Lindell

Journal of Cryptology•Nov 30, 2005•83 citations