14 search results - page 1 / 3 » Secure Multiparty Computation with Partial Fairness |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
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
2010
Springer
13 years 9 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...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...