Private approximation of search problems

DOI10.1145/1132516.1132533zbMath1301.68265OpenAlexW2047515520MaRDI QIDQ2931376

Paz Carmi, Enav Weinreb, Kobbi Nissim, Amos Beimel

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

zbMATH Keywords

vertex coversecure computationprivate approximationsolution-list algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Unnamed Item ⋮ How should we solve search problems privately? ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ Private multiparty sampling and approximation of vector combinations

This page was built for publication: Private approximation of search problems