STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
STOC
2002
ACM
14 years 5 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...