• Publications
  • Influence
Containment and equivalence for a fragment of XPath
TLDR
We study a class of XPath queries that contain branching, label wildcards and can express descendant relationships between nodes. Expand
  • 345
  • 59
  • PDF
Resisting structural re-identification in anonymized social networks
TLDR
In this paper, we introduce a parameterized model of structural knowledge available to the adversary and quantify the success of attacks on individuals in anonymized networks. Expand
  • 403
  • 57
  • PDF
Boosting the accuracy of differentially private histograms through consistency
TLDR
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Expand
  • 425
  • 56
  • PDF
Anonymizing Social Networks
TLDR
We propose a novel anonymization technique based on perturbing the network and demonstrate empirically that it leads to substantial reduction of the privacy threat. Expand
  • 382
  • 47
  • PDF
Containment and equivalence for an XPath fragment
TLDR
We study the containment and equivalence problems for a class of XPath queries that contain branching, label wildcards and can express descendant relationships between nodes. Expand
  • 311
  • 44
  • PDF
Accurate Estimation of the Degree Distribution of Private Networks
TLDR
We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. Expand
  • 250
  • 31
  • PDF
Optimizing linear counting queries under differential privacy
TLDR
We propose the matrix mechanism, a new algorithm for answering a workload of predicate counting queries, and investigate the problem of computing the optimal query strategy in support of a given workload. Expand
  • 294
  • 30
  • PDF
Processing XML streams with deterministic automata and stream indexes
TLDR
We consider the problem of evaluating a large number of XPath expressions on a stream of XML packets. Expand
  • 215
  • 25
  • PDF
A formal analysis of information disclosure in data exchange
We perform a theoretical study of the following query-view security problem: given a view V to be published, does V logically disclose information about a confidential query S? The problem isExpand
  • 217
  • 22
  • PDF
Processing XML Streams with Deterministic Automata
TLDR
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Expand
  • 248
  • 21
  • PDF