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

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen

Published Jan 1, 2019• 23 citations
Publisher
DOI
10.1007/978-3-030-26951-7_3

Related papers

Communication Lower Bounds for Perfect Maliciously Secure MPC.

Ivan Damgård, Nikolaj I. Schwartzbach

•Jan 1, 2020•1 citation

New Upper and Lower Bounds for Perfectly Secure MPC

Ivan Damgård, Shravani Patil, Arpita Patra +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Statistically Secure Asynchronous MPC with Linear Communication and $$\mathcal {O}(n^5)$$ Additive Overhead

Xiaoyu Ji, Yifan Song

Lecture notes in computer science•Jan 1, 2026•0 citations

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience

Ashish Choudhury, Arpita Patra

Journal of Cryptology•Mar 25, 2023•25 citations

Network Agnostic MPC with Statistical Security

Ananya Appan, Ashish Choudhury

arXiv:2306.01401•Lecture notes in computer science•Jan 1, 2023•8 citations

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing

Ashish Choudhury, Emmanuela Orsini, Arpita Patra +1 more

Lecture notes in computer science•Jan 1, 2016•4 citations
Statistically Secure Asynchronous MPC with Linear Communication and O(n5)\mathcal {O}(n^5)O(n5) Additive Overhead