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 Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

Published Jan 1, 2015• 46 citations
Publisher
DOI
10.1007/978-3-662-46494-6_10

Related papers

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Gilad Asharov

Lecture notes in computer science•Jan 1, 2014•45 citations

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

Journal of Cryptology•Sep 14, 2010•35 citations

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2010•74 citations

Legally-Enforceable Fairness in Secure Two-Party Computation

Andrew Y. Lindell

Lecture notes in computer science•Jan 1, 2008•51 citations

An Efficient Protocol for Fair Secure Two-Party Computation

Mehmet Sabır Kiraz, Berry Schoenmakers

Lecture notes in computer science•Apr 4, 2008•15 citations

Efficiently Making Secure Two-Party Computation Fair

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

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