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

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Published Jan 1, 2009• 54 citations
Publisher
DOI
10.1007/978-3-642-00457-5_2

Related papers

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

Steven Gordon, Jonathan I. Katz

•Jan 1, 2008•0 citations

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

On the Power of an Honest Majority in Three-Party Computation Without Broadcast

Bar Alon, Ran Cohen, Eran Omri +1 more

Journal of Cryptology•Jun 7, 2023•1 citation

On the Power of an Honest Majority in Three-Party Computation Without Broadcast

Bar Alon, Ran Cohen, Eran Omri +1 more

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

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Handan Kılınç, Alptekın Küpçü

Lecture notes in computer science•Jan 1, 2015•26 citations