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

Position-Based Cryptography and Multiparty Communication Complexity

Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak

Published Jan 1, 2017• 6 citations
Publisher
DOI
10.1007/978-3-319-70500-2_3

Related papers

Robust Multiparty Computation with Linear Communication Complexity

Martin Hirt, Jesper Buus Nielsen

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

Quantum Multiparty Communication Complexity and Circuit Lower Bounds

Iordanis Kerenidis

Springer eBooks•Jul 22, 2007•8 citations

Asynchronous Multiparty Computation with Linear Communication Complexity

Ashish Choudhury, Martin Hirt, Arpita Patra

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

Asynchronous Multiparty Computation with Linear Communication Complexity

Choudhary, Ashish, Martin Hirt, Arpita Patra

•Jan 1, 2013•0 citations

Bounds on Oblivious Multiparty Quantum Communication Complexity

François Le Gall, Daiki Suruga

arXiv:2210.15402•Lecture notes in computer science•Jan 1, 2022•4 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