310 search results - page 2 / 62 » An Efficient Protocol for Fair Secure Two-Party Computation |
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
CTRSA
2008
Springer
13 years 7 months ago
2008
Springer
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
WISA
2010
Springer
13 years 3 months ago
2010
Springer
CRYPTO
2001
Springer
13 years 10 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...