Abstract
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is on private approximation of the vertex cover problem and two well studied clustering problems – k-center and k-median. Vertex cover was considered in [Beimel, Carmi, Nissim, and Weinreb, STOC, 2006] and we improve their infeasibility results. Clustering algorithms are frequently applied to sensitive data, and hence are of interest in the contexts of secure computation and private approximation. We show that these problems do not admit private approximations, or even approximation algorithms that leak significant number of bits. For the vertex cover problem we show a tight infeasibility result: every algorithm that ρ(n)-approximates vertex-cover must leak Ω(n/ρ(n)) bits (where n is the number of vertices in the graph). For the clustering problems we prove that even approximation algorithms with a poor approximation ratio must leak Ω(n) bits (where n is the number of points in the instance). For these results we develop new proof techniques, which are more simple and intuitive than those in Beimel et al., and yet allow stronger infeasibility results. Our proofs rely on the hardness of the promise problem where a unique optimal solution exists [Valiant and Vazirani, Theoretical Computer Science, 1986], on the hardness of approximating witnesses for NP-hard problems ([Kumar and Sivakumar, CCC, 1999] and [Feige, Langberg, and Nissim, APPROX, 2000]), and on a simple random embedding of instances into bigger instances.
Research partially supported by the Israel Science Foundation (grant No. 860/06), and by the Frankel Center for Computer Science. Research partly done when the first and third authors were at the Institute for Pure and Applied Mathematics, UCLA.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beimel, A., Carmi, P., Nissim, K., Weinreb, E.: Private approximation of search problems. In: Proc. of the 38th STOC, pp. 119–128 (2006)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th STOC, pp. 1–10 (1988)
Berman, L., Hartmanis, J.: On isomorphisms and density of NP and other complete sets. SICOMP 6, 305–322 (1977)
Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: Proc. of the 24th PODS, pp. 128–138 (2005)
Feige, U., Langberg, M., Nissim, K.: On the hardness of approximating NP witnesses. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 120–131. Springer, Heidelberg (2000)
Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. TALG 2(3), 435–472 (2006)
Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th STOC, pp. 218–229 (1987)
Gonzalez, T.F.: Clustering to minimize the maximum inter-cluster distance. TCS 38, 293–306 (1985)
Halevi, S., Krauthgamer, R., Kushilevitz, E., Nissim, K.: Private approximation of NP-hard functions. In: Proc. of the 33th STOC, pp. 550–559 (2001)
Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. JACM 33, 533–550 (1986)
Hsu, W.L., Nemhauser, G.L.: Easy and hard bottleneck location problems. DAM 1, 209–216 (1979)
Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 245–264. Springer, Heidelberg (2006)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, part I: the p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
Kiltz, E., Leander, G., Malone-Lee, J.: Secure computation of the mean and related statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 283–302. Springer, Heidelberg (2005)
Kumar, R., Sivakumar, D.: Proofs, codes, and polynomial-time reducibilities. In: Proc. of the 14th CCC, pp. 46–53 (1999)
Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
Plesnik, J.: On the computational complexity of centers locating in a graph. Aplikace Matematiky 25, 445–452 (1980)
Simon, J.: On the difference between one and many. In: Salomaa, A., Steinby, M. (eds.) Automata, Languages and Programming. LNCS, vol. 52, pp. 480–491. Springer, Heidelberg (1977)
Valiant, L.G.: A reduction from satisfiability to Hamiltonian circuits that preserves the number of solutions (Manuscript). Leeds Press, Leeds (1974)
Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. TCS 47, 85–93 (1986)
Yao, A.C.: Protocols for secure computations. In: Proc. of the 23th FOCS, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Hallak, R., Nissim, K. (2007). Private Approximation of Clustering and Vertex Cover. In: Vadhan, S.P. (eds) Theory of Cryptography. TCC 2007. Lecture Notes in Computer Science, vol 4392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70936-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-70936-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70935-0
Online ISBN: 978-3-540-70936-7
eBook Packages: Computer ScienceComputer Science (R0)