164 search results - page 4 / 33 » Covert two-party computation |
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
EUROCRYPT
2007
Springer
15 years 1 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...
ASIACRYPT
2009
Springer
15 years 4 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...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
SCN
2008
Springer
14 years 9 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...