546 search results - page 4 / 110 » On the Power of Secure Two-Party Computation |
ASIACRYPT
2009
Springer
14 years 12 days ago
2009
Springer
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
TCC
2012
Springer
12 years 1 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
EUROCRYPT
2010
Springer
13 years 10 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...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
EUROCRYPT
2003
Springer
13 years 11 months 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...