166 citations · 514 across the 44 of their papers we have counts for
4 papers · 1 filter
Approximately Counting Embeddings into Random Graphs
Martin Furer, Shiva Prasad Kasiviswanathan
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous re…
Composition Attacks and Auxiliary Information in Data Privacy
Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith
Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary information…
On the `Semantics' of Differential Privacy: A Bayesian Formulation
Shiva Prasad Kasiviswanathan, Adam Smith
Differential privacy is a definition of "privacy'" for algorithms that analyze and publish information about statistical databases. It is often claimed that differential privacy pr…
What Can We Learn Privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim +2
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept c…