977 search results - page 14 / 196 » Secure Computation with Fixed-Point Numbers |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
CCS
2008
ACM
13 years 9 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 6 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...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
General trust management model that we present is adapted for ad-hoc coalition environment, rather than for classic client-supplier relationship. The trust representation used in ...