150 search results - page 4 / 30 » Fair Secure Two-Party Computation |
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 ...
ASIACRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
CRYPTO
2007
Springer
14 years 9 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
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...