71 search results - page 4 / 15 » Round-Optimal Secure Two-Party Computation |
ASIACRYPT
2009
Springer
14 years 1 months 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...
ASIACRYPT
2005
Springer
14 years 12 days 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
2010
Springer
13 years 11 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 10 months ago
2007
Springer
CRYPTO
2007
Springer
14 years 1 months 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...