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

A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model

Geoffroy Couteau

Published Jan 1, 2019• 44 citations
Publisher
DOI
10.1007/978-3-030-17656-3_17

Related papers

Robust Multiparty Computation with Linear Communication Complexity

Martin Hirt, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2006•66 citations

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

Martin Hirt, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2005•22 citations

Asynchronous Multiparty Computation with Linear Communication Complexity

Choudhary, Ashish, Martin Hirt, Arpita Patra

•Jan 1, 2013•0 citations

Asynchronous Multiparty Computation with Linear Communication Complexity

Ashish Choudhury, Martin Hirt, Arpita Patra

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

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

Vipul Goyal, Yuval Ishai, Yifan Song

Lecture notes in computer science•Jan 1, 2022•2 citations

Non-Interactive Multiparty Computation Without Correlated Randomness

Shai Halevi, Yuval Ishai, Abhishek Jain +3 more

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