Abstract We demonstrate how Game Theoretic concepts and formalism can be used to
capture cryptographic notions of security. In the restricted but indicative case of two-party …

Fairness is a desirable property in secure computation; informally it means that if one party
gets the output of the function, then all parties get the output. Alas, an implication of Cleve's …

The well known impossibility result of Cleve (STOC 1986) implies that in general it is
impossible to securely compute a function with complete fairness without an honest majority …

Correlated pairs of random variables are a central concept in information-theoretically
secure cryptography. Secure reductions between different correlations have been studied …

Two parties, P 1 and P 2, wish to jointly compute some function f (x, y) where P 1 only knows
x, whereas P 2 only knows y. Furthermore, and most importantly, the parties wish to reveal …

A two-party fair coin-tossing protocol guarantees output delivery to the honest party even
when the other party aborts during the protocol execution. Cleve (STOC–1986) …

In the setting of solitary output computations, only a single designated party learns the output
of some function applied to the private inputs of all participating parties with the guarantee …

In a sense, a two-party protocol achieves fairness if the output from the computation is
obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that …

安全求和协议作为安全多方计算的一种实例, 在分布式数据挖掘, 统计分析和电子选举等领域
有着非常广泛的应用. 但是传统协议在求和过程中存在计算不公平的问题. 针对这个问题 …

Fully secure multiparty computation (MPC) allows a set of parties to compute some function
of their inputs, while guaranteeing correctness, privacy, fairness, and output delivery …