860 search results - page 1 / 172 » Completeness in two-party secure computation: a computationa... |
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense ...
SCN
2008
Springer
13 years 5 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...
WISA
2010
Springer
13 years 3 months ago
2010
Springer
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...