Local, Private, Efficient Protocols for Succinct Histograms
From MaRDI portal
Publication:2941496
DOI10.1145/2746539.2746632zbMath1321.94037arXiv1504.04686OpenAlexW3102859907MaRDI QIDQ2941496
No author found.
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04686
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (12)
Comment ⋮ Unnamed Item ⋮ Key-value data collection and statistical analysis with local differential privacy ⋮ Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments ⋮ Forty years of frequent items ⋮ Locally differentially private item-based collaborative filtering ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Scalable and Jointly Differentially Private Packing ⋮ Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Complexity of Differential Privacy
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Local, Private, Efficient Protocols for Succinct Histograms
