71 search results - page 3 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
CAV
2009
Springer
14 years 8 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
ACNS
2011
Springer
12 years 11 months ago
2011
Springer
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
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...