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

Better Two-Round Adaptive Multi-party Computation

Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam

Published Jan 1, 2017• 12 citations
Publisher
DOI
10.1007/978-3-662-54388-7_14

Related papers

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 and Computational Efficiency of Multi-party Protocols

Michele Ciampi, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Round-Optimal Secure Multi-party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

Journal of Cryptology•May 13, 2021•14 citations

More Efficient Constant-Round Multi-party Computation from BMR and SHE

Yehuda Lindell, Nigel Paul Smart, Eduardo Soria-Vázquez

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

Round-Optimal Secure Multi-Party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

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

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Lecture notes in computer science•Jan 1, 2003•95 citations