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

Broadcast-Optimal Two Round MPC with an Honest Majority

Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov

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

Related papers

Broadcast-Optimal Two Round MPC with an Honest Majority.

Ivan Damgård, Bernardo Magri, Luisa Siniscalchi +1 more

•Jan 1, 2020•0 citations

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security

Benny Applebaum, Eliran Kachlon, Arpita Patra

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

Broadcast-Optimal Two-Round MPC

Ran Cohen, Juan A. Garay, Vassilis Zikas

Lecture notes in computer science•Jan 1, 2020•24 citations

Minimizing Setup in Broadcast-Optimal Two Round MPC

Ivan Damgård, Divya Ravi, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2023•11 citations

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels

Ivan Damgård, Divya Ravi, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2023•2 citations

Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions

Junru Li, Yifan Song

Lecture notes in computer science•Dec 1, 2025•3 citations