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

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

Arpita Patra, Divya Ravi

Published Jan 1, 2019• 9 citations
Publisher
DOI
10.1007/978-3-030-34578-5_17

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

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2009•54 citations

Complete Fairness in Multi-Party Computation Without an Honest Majority.

Steven Gordon, Jonathan I. Katz

•Jan 1, 2008•0 citations

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Lecture notes in computer science•Jan 1, 2003•95 citations

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

Anne Broadbent, Stacey Jeffery, Samuel Ranellucci +1 more

Lecture notes in computer science•Jan 1, 2012•1 citation

Improved Building Blocks for Secure Multi-party Computation Based on Secret Sharing with Honest Majority

Marina Blanton, Ah Reum Kang, Chen Yuan

Lecture notes in computer science•Jan 1, 2020•22 citations