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

Revealing Additional Information in Two-Party Computations

Andreas Jakoby, Maciej Liśkiewicz

Published Jan 1, 2005• 1 citation
Publisher
DOI
10.1007/11593447_7

Related papers

TASTY: tool for automating secure two-party computations

Wilko Henecka, Stefan K ögl, Ahmad‐Reza Sadeghi +2 more

Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the outcome. Existing cryptographic compilers can automatically generate secure computation protocols from high-level specifications, but are often limited in their use and efficiency of generated protocols as they are based on either garbled circuits or (additively) homomorphic encryption only.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 4, 2010•359 citations

Efficient Covert Two-Party Computation

Stanisław Jarecki

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

Privacy, additional information and communication

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz +1 more

Two parties, each holding one input of a two-variable function, communicate in order to determine the value of the function. Each party wants to expose as little of its input as possible to the other party. The authors prove tight bounds on the minimum amount of information about the individual inputs that must be revealed in the computation of most functions and of some specific ones. They also show that a computation that reveals little information about the individual inputs may require many more message exchanges than a more revealing computation.>

IEEE Transactions on Information Theory•Jan 1, 1993•54 citations

Two-party information splitting

Patrick J. Coles, Li Yu, Vlad Gheorghiu +1 more

Bulletin of the American Physical Society•Mar 19, 2010•0 citations

Fairness in two-party computation: characterizing fair functions

Nikolaos Makriyannis

Secure two-party computation is a classic problem in cryptography. It involves two parties computing a function of their private inputs, and only revealing what the output suggests. Additional security requirements may include fairness, which states that either all parties receive output, or no one does. A seminal result from the 1980's demonstrates that fairness cannot be guaranteed for all functions, and only recently have certain functions been shown to be computable with fairness. The two results naturally give rise to a distinction between fair functions and unfair ones. In this work, we investigate the characterization of such functions in the two-party setting. In the end, we obtain a full characterization for Boolean functions, and we develop a number of useful techniques for characterizing arbitrary fair functions.

•Sep 20, 2016•1 citation

Everlasting Multi-party Computation

Dominique Unruh

Lecture notes in computer science•Jan 1, 2013•52 citations
Two parties, each holding one input of a two-variable function, communicate in order to determine the value of the function. Each party wants to expose as little of its input as possible to the other party. The authors prove tight bounds on the minimum amount of information about the individual inputs that must be revealed in the computation of most functions and of some specific ones. They also show that a computation that reveals little information about the individual inputs may require many more message exchanges than a more revealing computation.>
Secure two-party computation is a classic problem in cryptography. It involves two parties computing a function of their private inputs, and only revealing what the output suggests. Additional security requirements may include fairness, which states that either all parties receive output, or no one does. A seminal result from the 1980's demonstrates that fairness cannot be guaranteed for all functions, and only recently have certain functions been shown to be computable with fairness. The two results naturally give rise to a distinction between fair functions and unfair ones. In this work, we investigate the characterization of such functions in the two-party setting. In the end, we obtain a full characterization for Boolean functions, and we develop a number of useful techniques for characterizing arbitrary fair functions.