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 GOD MPC with $$O(\textsf{depth}(C))$$ Rounds and Low Online Communication

Amit Agarwal, Alexander Bienstock, Ivan Damgård, Daniel E. Escudero

Published Dec 11, 2024• 1 citation
Publisher
DOI
10.1007/978-981-96-0938-3_8

Related papers

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

Honest Majority MPC with Abort with Minimal Online Communication

Anders Dalskov, Daniel E. Escudero

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

Honest Majority MPC with Abort with Minimal Online Communication.

Daniel E. Escudero, Anders Dalskov

•Jan 1, 2020•2 citations

On Fully-Secure Honest Majority MPC Without $$n^2$$ Round Overhead

Daniel E. Escudero, Serge Fehr

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

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee +1 more

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

Honest Majority MPC with $$\tilde{O}(|C|)$$ Communication in Minicrypt

Yifan Song, Xiangtao Ye

Lecture notes in computer science•Jan 1, 2025•2 citations
Honest Majority GOD MPC with O(depth(C))O(\textsf{depth}(C))O(depth(C)) Rounds and Low Online Communication
On Fully-Secure Honest Majority MPC Without n2n^2n2 Round Overhead
Honest Majority MPC with O~(∣C∣)\tilde{O}(|C|)O~(∣C∣) Communication in Minicrypt