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

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Gilad Asharov

Published Jan 1, 2014• 45 citations
Publisher
DOI
10.1007/978-3-642-54242-8_13

Related papers

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis +1 more

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

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

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

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

Journal of Cryptology•Sep 14, 2010•35 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

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

Secure Two-Party Computation with Fairness - A Necessary Design Principle

Yehuda Lindell, Tal Rabin

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