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

Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem

Vipul Goyal, Antigoni Polychroniadou, Yifan Song

Published Jan 1, 2021• 35 citations
Publisher
DOI
10.1007/978-3-030-84245-1_10

Related papers

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

Vipul Goyal, Yanyi Liu, Yifan Song

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

Concretely Efficient Fluid MPC with Linear Communication

Yubo Zeng, Kang Yang, Dengguo Feng +1 more

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

Communication-Efficient MPC for General Adversary Structures

Joshua Lampkins, Rafail Ostrovsky

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

On Communication-Efficient Asynchronous MPC with Adaptive Security

Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang

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

Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead

Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate +2 more

Lecture notes in computer science•Jan 1, 2025•6 citations

Unconditionally Secure MPC for Boolean Circuits with Constant Communication

Yubo Zeng, Kang Yang, Dengguo Feng +1 more

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