• Calendar

July 9, Wednesday
12:30 – 14:00

In the problem of secure computation, two or more parties wish to compute a function of their private inputs while maintaining several security properties, such as independence of their inputs, privacy, correctness of the computation and others. General protocols for computing all of the above properties, and others, are well known. An exception is the emph{fairness} property, which guarantees that if one party receives output, then all parties receive output. Fairness is only generally achievable if a strict majority of the players are honest. Indeed, it was proven by Cleve cite{Cleve86} in 1986 that it is impossible for two parties to flip a fair coin.

In this talk, I will first present a recent surprising result (STOC 08) that demonstrates the possibility of computing certain particular functions of interest with complete fairness. I will then introduce a new (weaker) security definition called "partial fairness", and present a general feasibility results in this model.