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

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

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

Published Jan 1, 2016• 361 citations
Publisher
DOI
10.1007/978-3-662-53641-4_21

Related papers

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart +1 more

Journal of Cryptology•Apr 26, 2019•32 citations

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart +1 more

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

Round and Computational Efficiency of Multi-party Protocols

Michele Ciampi, Luisa Siniscalchi

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

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions

Sandro Coretti, Juan A. Garay, Martin Hirt +1 more

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

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

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