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

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits.

Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Schöll, Nigel Paul Smart

Published Jan 1, 2012• 4 citations
OpenAlex

Related papers

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Emmanuela Orsini

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

On the Round Complexity of Dishonest-Majority MPC

Ran Cohen, Daniel E. Collins, Pouyan Forghani +2 more

Lecture notes in computer science•Oct 30, 2026•0 citations

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing

Vipul Goyal, Antigoni Polychroniadou, Yifan Song

Lecture notes in computer science•Jan 1, 2022•30 citations

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

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

Malicious Security Comes Free in Honest-Majority MPC.

Vipul Goyal, Yifan Song

•Jan 1, 2020•10 citations