164 search results - page 19 / 33 » Covert two-party computation |
CCS
2008
ACM
13 years 11 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
CORR
2010
Springer
13 years 8 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...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
TCC
2009
Springer
14 years 10 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...
COCO
2010
Springer
14 years 1 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...