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 MPC with $$\tilde{O}(|C|)$$ Communication in Minicrypt

Yifan Song, Xiangtao Ye

Published Jan 1, 2025• 2 citations
Publisher
DOI
10.1007/978-3-031-91092-0_16

Related papers

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

Achieving Guaranteed Output Delivery MPC with Constant Rounds and Linear Communication in Minicrypt

Junru Li, Yifan Song

Lecture notes in computer science•Jan 1, 2026•0 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

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Peter Sebastian Nordholt, Meilof Veeningen

Lecture notes in computer science•Jan 1, 2018•40 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
Honest Majority MPC with O~(∣C∣)\tilde{O}(|C|)O~(∣C∣) Communication in Minicrypt
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