686 search results - page 1 / 138 » Secure Two-Party Computation Is Practical |
ASIACRYPT
2009
Springer
13 years 11 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
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
SCN
2008
Springer
13 years 4 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
CRYPTO
2007
Springer
13 years 10 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...