Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access
Indsendt manuskript, 793 KB, PDF-dokument
Representing a sparse histogram, or more generally a sparse vector, is a fundamental task in differential privacy. An ideal solution would use space close to information-theoretical lower bounds, have an error distribution that depends optimally on the desired privacy level, and allow fast random access to entries in the vector. However, existing approaches have only achieved two of these three goals. In this paper we introduce the Approximate Laplace Projection (ALP) mechanism for approximating k-sparse vectors. This mechanism is shown to simultaneously have information-theoretically optimal space (up to constant factors), fast access to vector entries, and error of the same magnitude as the Laplace-mechanism applied to dense vectors. A key new technique is a unary representation of small integers, which we show to be robust against "randomized response'' noise. This representation is combined with hashing, in the spirit of Bloom filters, to obtain a space-efficient, differentially private representation. Our theoretical performance bounds are complemented by simulations which show that the constant factors on the main performance parameters are quite small, suggesting practicality of the technique.
Originalsprog | Engelsk |
---|---|
Titel | CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security |
Forlag | Association for Computing Machinery |
Publikationsdato | 2021 |
Sider | 1223-1236 |
ISBN (Elektronisk) | 9781450384544 |
DOI | |
Status | Udgivet - 2021 |
Begivenhed | 27th ACM Annual Conference on Computer and Communication Security, CCS 2021 - Virtual, Online, Sydkorea Varighed: 15 nov. 2021 → 19 nov. 2021 |
Konference
Konference | 27th ACM Annual Conference on Computer and Communication Security, CCS 2021 |
---|---|
Land | Sydkorea |
By | Virtual, Online |
Periode | 15/11/2021 → 19/11/2021 |
Sponsor | ACM Special Interest Group on Security, Audit and Control (ACM SIGSAC), Korea Institute of Information Security and Cryptology (KIISC) |
Navn | Proceedings of the ACM Conference on Computer and Communications Security |
---|---|
ISSN | 1543-7221 |
ID: 301141144