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

Communication Lower Bounds for Perfect Maliciously Secure MPC.

Ivan Damgård, Nikolaj I. Schwartzbach

Published Jan 1, 2020• 1 citation
OpenAlex

Related papers

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

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

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

Lecture notes in computer science•Jan 1, 2019•18 citations

Perfectly-Secure MPC with Linear Communication Complexity

Zuzana Beerliová-Trubíniová, Martin Hirt

Springer eBooks•Feb 25, 2008•225 citations

Perfectly-Secure MPC with Constant Online Communication Complexity

Yifan Song, Xiangtao Ye

Lecture notes in computer science•Dec 2, 2024•2 citations

Two Round Information-Theoretic MPC with Malicious Security

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

Lecture notes in computer science•Jan 1, 2019•26 citations

Malicious Security Comes Free in Honest-Majority MPC.

Vipul Goyal, Yifan Song

•Jan 1, 2020•10 citations