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

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Peter Sebastian Nordholt, Meilof Veeningen

Published Jan 1, 2018• 40 citations
Publisher
DOI
10.1007/978-3-319-93387-0_17

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

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

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Koki Hamada, Dai Ikarashi +4 more

Journal of Cryptology•Apr 18, 2023•15 citations

Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC

Thomas Attema, Vincent Dunning, Maarten H. Everts +1 more

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

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 Fully-Secure Honest Majority MPC Without n2n^2n2 Round Overhead