Abstract
We consider data release protocols for data X = (S, U), where S is sensitive; the released data Y contains as much information about X as possible, measured as I(X; Y ), without leaking too much about S. We introduce the Robust Local Differential Privacy (RLDP) framework to measure privacy. This framework relies on the underlying distribution of the data, which needs to be estimated from available data. Robust privacy guarantees ensure privacy for all distributions in a confidence set based on this estimate. We also present three algorithms that construct RLDP protocols from a given dataset. One of these approximates the confidence set by a polytope and uses results from robust optimisation to yield high utility release protocols. However, it relies on vertex enumeration and becomes computationally infeasible for large input alphabets. The other two algorithms are low-complexity and build on randomised response. Experiments verify that all three algorithms offer significantly improved utility over regular LDP.
Original language | English |
---|---|
Title of host publication | IEEE International Symposium on Information Theory |
Subtitle of host publication | ISIT |
Publisher | IEEE |
Pages | 557-562 |
Number of pages | 6 |
ISBN (Electronic) | 978-1-5386-8209-8 |
ISBN (Print) | 978-1-5386-8210-4 |
DOIs | |
Publication status | Published - 1 Sept 2021 |
Event | IEEE International Symposium on Information Theory, ISIT 2021 - Virtual Event, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021 https://ieeexplore.ieee.org/xpl/conhome/9517708/proceeding |
Conference
Conference | IEEE International Symposium on Information Theory, ISIT 2021 |
---|---|
Abbreviated title | ISIT 2021 |
Country/Territory | Australia |
City | Melbourne |
Period | 12/07/21 → 20/07/21 |
Internet address |
Keywords
- Differential privacy
- Privacy
- Uncertainty
- Protocols
- Closed-form solutions
- Publishing
- Robustness