#### Filter Results:

- Full text PDF available (46)

#### Publication Year

2004

2017

- This year (4)
- Last 5 years (22)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

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 classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training example? More precisely, we investigate… (More)

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 (also called external knowledge, background knowledge, or side information) that an adversary gleans from other channels such as the web, public records, or domain knowledge.… (More)

We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic subgradients with efficient incremental SVD updates, made possible by highly optimized and parallelizable dense linear algebra… (More)

Marginal (contingency) tables are the method of choice for government agencies releasing statistical summaries of categorical data. In this paper, we derive lower bounds on how much distortion (noise) is necessary in these tables to ensure the privacy of sensitive data. We extend a line of recent work on impossibility results for private data analysis [9,… (More)

We develop algorithms for the private analysis of network data that provide accurate analysis of realistic networks while satisfying stronger privacy guarantees than those of previous work. We present several techniques for designing node differentially private algorithms, that is, algorithms whose output distribution does not change significantly when a… (More)

- Martin Fürer, Shiva Prasad Kasiviswanathan
- Electronic Colloquium on Computational Complexity
- 2005

An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-Cnf formula. The worst case running time of O(1.246) for formulas with n variables improves on the previous bound of O(1.256) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a consequence we get an… (More)

- Shiva Prasad Kasiviswanathan, Adam D. Smith
- IACR Cryptology ePrint Archive
- 2008

In this note we give a precise formulation of “resistance to arbitrary side information” and show that several relaxations of differential privacy imply it. The formulation follows the ideas originally due to Dwork and McSherry, stated implicitly in [4]. This is, to our knowledge, the first place such a formulation appears explicitly. The proof that relaxed… (More)

- Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim
- Machine Learning
- 2010

Learning is a task that generalizes many of the analyses that are applied to collections of data, in particular, to collections of sensitive individual information. Hence, it is natural to ask what can be learned while preserving individual privacy. Kasiviswanathan et al. (in SIAM J. Comput., 40(3):793–826, 2011) initiated such a discussion. They formalized… (More)

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 (also called external knowledge, background knowledge, or side information) that an adversary gleans from other channels such as the web, public records, or domain knowledge.… (More)

Streaming user-generated content in the form of blogs, microblogs, forums, and multimedia sharing sites, provides a rich source of data from which invaluable information and insights maybe gleaned. Given the vast volume of such social media data being continually generated, one of the challenges is to automatically tease apart the emerging topics of… (More)