Profile-based Privacy for Locally Private Computations
From Google TechTalks · 24:30
Show by Google TechTalks
A Google TechTalk, 2020/7/30, presented by Kamalika Chaudhuri, UCSDABSTRACT: Differential privacy has emerged as a gold standard in privacy-preserving data analysis. A popular variant commonly used for federated learning is local differential privacy, where the data holder is the trusted curator. A major barrier, however, towards a wider adoption of this model is that it offers a poor privacy-utility tradeoff. In this work, we address this problem by introducing a new variant of local privacy called profile-based privacy. The central idea is that the problem setting comes with a graph G of data generating distributions, whose edges encode sensitive pairs of distributions that should be made indistinguishable. This provides higher utility because unlike local differential privacy, we no longer need to make every pair of private values in the domain indistinguishable, and instead only protect the identity of the underlying distribution. We establish privacy properties of the profile-based privacy definition, such as post-processing invariance and graceful composition. Finally, we provide mechanisms that are private in this framework, and show via simulations that they achieve higher utility than the corresponding local differential privacy mechanisms.Uploaded 04-06-21
More episodes of Google TechTalks
More episodes
- 360 Video
- Multi-Party Computation: From Theory to Practice
- The Extended Mind: Recent Experimental Evidence
- DSD: A Hybrid Analysis Tool for Bug Finding
- Chasing the Constants and its Implications in Differential Privacy
- Making Great Decisions
- Streaming Private Continual Counting via Binning
- Distributed Testing with SmartFrog
- Differentially Private Synthetic Data without Training
- A Dynamic Network Layer for Advanced Cloud Computing
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.