103
click to vote
EUROCRYPT
2010
Springer
15 years 4 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
79
Voted
TCC
2009
Springer
16 years 5 days ago
2009
Springer
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...