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

On Secure Two-Party Computation in Three Rounds

Prabhanjan Ananth, Abhishek Jain

Published Jan 1, 2017• 6 citations
Publisher
DOI
10.1007/978-3-319-70500-2_21

Related papers

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

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

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

•Jan 1, 2004•0 citations

Two-Round Concurrently Secure Two-Party Computation.

Behzad Abdolmaleki, Giulio Malavolta, Ahmadreza Rahimi

•Jan 1, 2021•0 citations

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Aug 18, 2021•1 citation

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2018•34 citations

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Lecture notes in computer science•Jan 1, 2016•32 citations