Skip to main content

Search

Sort & Filters

Filters

Content type
Publication type
Year
Year of Publication

75 results for "Privacy"

75 results for "Privacy"

Privacy Tools Project

Page
Led by Salil Vadhan, the Privacy Tools Project (more fully, "Privacy Tools for Sharing Research Data"), is a broad effort to advance a multidisciplinary understanding of data privacy issues and build computational, statistical, legal, and policy tools to...

Privacy games

Journal Article

Version History: 

Previously published as: Yiling Chen, Or Sheffet, and Salil Vadhan. Privacy games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE ‘14), volume 8877 of Lecture Notes in Computer Science, pages 371...

Differential privacy: A primer for a non-technical audience

Journal Article

Version History: Preliminary version workshopped at PLSC 2017.

Differential privacy is a formal mathematical framework for quantifying and managing privacy risks. It provides provable privacy protection against a wide range of potential attacks...

The privacy of the analyst and the power of the state

Conference Paper
We initiate the study of privacy for the analyst in differentially private data analysis. That is, not only will we be concerned with ensuring differential privacy for the data (i.e. individuals or customers), which are the usual concern of differential...

Boosting and differential privacy

Conference Paper
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are data structures that yield, for a given set \(\mathcal{Q}\) of queries over...

Computational differential privacy

Conference Paper

The definition of differential privacy has recently emerged as a leading standard of privacy guarantees for algorithms on statistical databases. We offer several relaxations of the definition which require privacy guarantees to hold only against efficien...

Differential privacy with imperfect randomness

Conference Paper

In this work we revisit the question of basing cryptography on imperfect randomness. Bosley and Dodis (TCC’07) showed that if a source of randomness \(\mathcal{R}\) is “good enough” to generate a secret key capable of encrypting \(k\) bits, then one can...

Concurrent composition of differential privacy

Conference Proceedings
Version History: Also appeared as a poster in TPDP ‘21 and PPML ‘21. Preliminary version posted as CoRR abs/2105.14427 and Cryptology ePrint Archive Report 2021/1196. Abstract: We initiate a study of the composition properties of interactive...