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

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority

Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp

Published Jan 1, 2012• 1 citation
Publisher
DOI
10.1007/978-3-642-32284-6_2

Related papers

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Jun 29, 2023•0 citations

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2019•9 citations

Trading correctness for privacy in unconditional multi-party computation

Matthias Fitzi, Martin Hirt, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 1998•64 citations

Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications

Benny Applebaum, Yuval Ishai, Or Karni +1 more

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

Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result

David Chaum, Ivan Damgård, Jeroen van de Graaf

Lecture notes in computer science•Jan 1, 1988•218 citations

From Fairness to Full Security in Multiparty Computation

Ran Cohen, Iftach Haitner, Eran Omri +1 more

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