Private Approximation of Search Problems

DOI10.1137/060671899zbMath1181.68327OpenAlexW1965368941MaRDI QIDQ3642862

Kobbi Nissim, Amos Beimel, Enav Weinreb, Paz Carmi

Publication date: 6 November 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060671899

zbMATH Keywords

vertex coversecure computationprivate approximationsolution-list algorithms

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 (2)

Unnamed Item ⋮ Two Party Distribution Testing: Communication and Security

This page was built for publication: Private Approximation of Search Problems