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

Round-Optimal Secure Multi-Party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam

Published Jan 1, 2018• 37 citations
Publisher
DOI
10.1007/978-3-319-96881-0_17

Related papers

Round-Optimal Secure Multi-party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

Journal of Cryptology•May 13, 2021•14 citations

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

•Jan 1, 2004•0 citations

On the Round Complexity Landscape of Secure Multi-party Computation

Divya Ravi

•Jan 18, 2021•0 citations

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

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

Secure Multi-party Computation Minimizing Online Rounds

Seung Geol Choi, Ariel Elbaz, Tal Malkin +1 more

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

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

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