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

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

Junru Li, Yifan Song

Published Dec 1, 2025• 3 citations
Publisher
DOI
10.1007/978-3-032-12287-2_1

Related papers

Dishonest Majority Constant-Round MPC with Linear Communication from DDH

Vipul Goyal, Junru Li, Ankit Kumar Misra +3 more

Lecture notes in computer science•Dec 11, 2024•12 citations

Honest Majority GOD MPC with $$O(\textsf{depth}(C))$$ Rounds and Low Online Communication

Amit Agarwal, Alexander Bienstock, Ivan Damgård +1 more

Lecture notes in computer science•Dec 11, 2024•1 citation

Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication

Junru Li, Yifan Song

Lecture notes in computer science•Jan 1, 2025•1 citation

Broadcast-Optimal Two Round MPC with an Honest Majority.

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

•Jan 1, 2020•0 citations

Honest Majority MPC with Abort with Minimal Online Communication

Anders Dalskov, Daniel E. Escudero

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

Broadcast-Optimal Two Round MPC with an Honest Majority

Ivan Damgård, Bernardo Magri, Divya Ravi +2 more

Lecture notes in computer science•Jan 1, 2021•13 citations
Honest Majority GOD MPC with O(depth(C))O(\textsf{depth}(C))O(depth(C)) Rounds and Low Online Communication