20 search results - page 3 / 4 » Approximate Privacy: PARs for Set Problems |
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
ACSAC
2001
IEEE
15 years 1 months ago
2001
IEEE
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
111
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
ECIR
2011
Springer
14 years 1 months ago
2011
Springer
We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates the target search resu...
108
click to vote
TCC
2012
Springer
13 years 5 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...