860 search results - page 4 / 172 » Completeness in two-party secure computation: a computationa... |
217
click to vote
TCC
2012
Springer
14 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 ...
165
click to vote
ASIACRYPT
2009
Springer
16 years 17 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...
182
click to vote
ASIACRYPT
2005
Springer
15 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...
188
click to vote
CRYPTO
2007
Springer
16 years 5 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...