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

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

Daniel E. Escudero, Serge Fehr

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-44469-2_3

Related papers

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

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

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

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

Round-Optimal Secure Multiparty Computation with Honest Majority

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

Lecture notes in computer science•Jan 1, 2018•47 citations

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Daniel Genkin, Koki Hamada +4 more

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