686 search results - page 5 / 138 » Secure Two-Party Computation Is Practical |
EUROCRYPT
2010
Springer
14 years 7 days 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...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
EUROCRYPT
2003
Springer
14 years 20 days ago
2003
Springer
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
