71 search results - page 11 / 15 » Round-Optimal Secure Two-Party Computation |
TDP
2010
13 years 2 months ago
2010
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
STOC
2010
ACM
14 years 12 days ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
PODC
2003
ACM
14 years 24 days 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...
CCS
2000
ACM
13 years 11 months ago
2000
ACM
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...