71 search results - page 2 / 15 » Round-Optimal Secure Two-Party Computation |
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...
CTRSA
2008
Springer
13 years 6 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...
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
2001
Springer
13 years 9 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...
CTRSA
2009
Springer
13 years 11 months ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...