Private approximation of search problems
DOI10.1145/1132516.1132533zbMATH Open1301.68265OpenAlexW2047515520MaRDI QIDQ2931376FDOQ2931376
Authors: Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb 
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132533
Recommendations
- Private Approximation of Search Problems
- Private approximation of NP-hard functions
- The Asymptotic Capacity of Private Search
- Theory of Cryptography
- scientific article; zbMATH DE number 2090941
- Near-optimal private approximation protocols via a black box transformation
- Privately solving linear programs
- Differentially private combinatorial optimization
- Privacy-preserving linear and nonlinear approximation via linear programming
- Private approximation of clustering and vertex cover
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (11)
- Functionally private approximations of negligibly-biased estimators
- Private Approximation of Clustering and Vertex Cover
- Private Approximation of Search Problems
- Fast Private Norm Estimation and Heavy Hitters
- Title not available (Why is that?)
- Private multiparty sampling and approximation of vector combinations
- How should we solve search problems privately?
- Private approximation of clustering and vertex cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- How Should We Solve Search Problems Privately?
This page was built for publication: Private approximation of search problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931376)
