Fast Private Norm Estimation and Heavy Hitters
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Communication Complexity
- Communication preserving protocols for secure function evaluation
- Fast, small-space algorithms for approximate histogram maintenance
- Privacy preserving data mining
- Private approximation of NP-hard functions
- Private approximation of search problems
- Private information retrieval
- Secure multiparty computation of approximations
- The space complexity of approximating the frequency moments
- Theory of Cryptography
- Theory of Cryptography
- Tracking join and self-join sizes in limited storage
Cited in
(6)- Two Party Distribution Testing: Communication and Security
- Privacy-preserving distributed algorithm for sparse vector sum
- Distributed private heavy hitters
- Local, private, efficient protocols for succinct histograms
- Practical locally private heavy hitters
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
This page was built for publication: Fast Private Norm Estimation and Heavy Hitters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445506)