Search
Filters
75 results for "Privacy"
75 results for "Privacy"
Privacy games
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
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
Boosting and differential privacy
Computational differential privacy
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...
Privacy odometers and filters: Pay-as-you-go composition
Version History: Full version posted as https://arxiv.org/abs/1605.08294.
In this paper we initiate the study of adaptive composition in differential privacy when the length of the composition, and the privacy parameters themselves can be chosen...
Usable differential privacy: A case study with PSI
Version History: v1, 11 September 2018 https://arxiv.org/abs/1809.04103
Differential privacy is a promising framework for addressing the privacy concerns in sharing sensitive datasets for others to analyze. However differential privacy is a highly...
Designing Access with Differential Privacy
Webinar: https://www.youtube.com/watch?v=cOu-sTV8J2M
This chapter explains how administrative data containing personal information can be collected, analyzed, and published in a way that ensures the individuals in the data will be afforded the strong...
Differential privacy with imperfect randomness
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...