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

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

Martin Hirt, Jesper Buus Nielsen

Published Jan 1, 2005• 22 citations
Publisher
DOI
10.1007/11593447_5

Related papers

Quantum Multiparty Communication Complexity and Circuit Lower Bounds

Iordanis Kerenidis

Springer eBooks•Jul 22, 2007•8 citations

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2010•4 citations

Robust Multiparty Computation with Linear Communication Complexity

Martin Hirt, Jesper Buus Nielsen

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

On the Message Complexity of Secure Multiparty Computation

Yuval Ishai, Manika Mittal, Rafail Ostrovsky

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