Private approximation of search problems

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1728-1760

  Beimel, Amos ^a   Carmi, Paz ^a   Nissim, Kobbi ^a   Weinreb, Enav ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b CWI   (Netherlands)

Author keywords

Private approximation; Secure computation; Solution list algorithms; Vertex cover

Indexed keywords

CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; CRYPTOGRAPHIC APPLICATIONS; DESIGN ALGORITHMS; EFFICIENT APPROXIMATION ALGORITHMS; EXACT SOLUTIONS; NEW YORK; NP-HARD; OPTIMAL SOLUTIONS; PRIVACY REQUIREMENTS; PRIVATE APPROXIMATION; SEARCH PROBLEMS; SECURE COMPUTATION; VERTEX COVER;

APPROXIMATION ALGORITHMS;

EID: 57849121671     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060671899     Document Type: Article

References (28)

1. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
2. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
3. R. BAR-YEHUDA, B. CHOR, E. KUSHILEVITZ, AND A. ORLITSKY, Privacy, additional information, and communication, IEEE Trans. Inform. Theory, 39 (1993), pp. 1930-1943.
4. R. BAR-YEHUDA AND S. EVEN, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math., 25 (1985), pp. 27-46.
5. A. BEIMEL, R. HALLAK, AND K. NISSIM, Private approximation of clustering and vertex cover, in Proceedings of the 4th Theory of Cryptography Conference (TCC 2007), S. Vadhan, ed., Lecture Notes in Comput. Sci. 4392, Springer-Verlag, 2007, New York, pp. 383-403.
6. A. BEIMEL, T. MALKIN, K. NISSIM, AND E. WEINREB., How should we solve search problems privately?, in Advances in Cryptology (CRYPTO 2007), A. Menezes, ed., Lecture Notes in Comput. Sci. 4622, Springer-Verlag, New York, 2007, pp. 31-49.
7. M. BELLARE AND E. PETRANK, Making zero-knowledge provers efficient, in Proceedings of the 24th ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 711-722.
8. B. CHOR, J. FRIEDMANN, O. GOLDREICH, J. HASTAD, S. RUDICH, AND R. SMOLANSKY, The bit extraction problem or t-resilient functions, in Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 1985, pp. 396-407.
9. I. DINUR. AND S. SAFRA, On the hardness of approximating minimum vertex cover, Ann. of Math. (2), 162 (2005), pp. 439-485.
10. J. FEIGENBAUM, Y. ISHAI, T. MALKIN, K. NISSIM, M. J. STRAUSS, AND R. N. WRIGHT, Secure multiparty computation of approximations, ACM Trans. Algorithms, 2 (2006), pp. 435-472.
11. M. J. FREEDMAN, K. NISSIM, AND B. PINKAS, Efficient private matching and set intersection, in Advances in Cryptology (EUROCRYPT 2004), C Cachin and J. Camenisch, eds., Lecture Notes in Comput. Sci. 3027, Springer-Verlag, New York, 2004, pp. 1-19.
12. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, HOW to play any mental game, in Proceedings of the 19th ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 218-229.
13. O. GOLDREICH, R. OSTROVSKY, AND E. PETRANK, Computational complexity and knowledge complexity, SIAM J. Comput., 27 (1998), pp. 1116-1141.
14. O. GOLDREICH AND E. PETRANK, Quantifying knowledge complexity, Comput. Complexity, 8 (1999), pp. 50-98.
15. S. GOLDWASSER, S. MICALI, AND C RACKOFF, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
16. S. HALEVI, R. KRAUTHGAMER, E. KUSHILEVITZ, AND K. NLSSIM, Private approximation of NP-hard functions, in Proceedings of the 33rd ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 550-559.
17. E. HALPERIN, Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs, in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, ACM', New York, SIAM, Philadelphia, 2000, pp. 329-337.
18. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
19. P. INDYK AND D. WOODRUFF, Polylogarithmic private approximations and efficient matching, in Proceedings of the 3rd Theory of Cryptography Conference (TCC 2006), S. Halevi and T. Rabin, eds., Lecture Notes in Comput. Sci. 3876, Springer-Verlag, New York, 2006, pp. 245-264.
20. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
21. S. KHOT AND O. REGEV, Vertex cover might be hard to approximate to within 2-e, J. Comput. System Sci., 74 (2008), pp. 335-349.
22. E. KLLTZ, G. LEANDER, AND J. MALONE-L EE, Secure computation of the mean and related statistics, in Proceedings of the 2nd Theory of Cryptography Conference (TCC 2005), J. Kilian, ed., Lecture Notes in Comput. Sci. 3378, Springer-Verlag, New York, 2005, pp. 283-302.
23. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
24. B. MONIEN AND E. SPECKENMEYER, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform., 22 (1985), pp. 115-123.
25. J. NAOR, AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
26. C H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci., 53 (1996), pp. 161-170.
27. E. PETRANK AND G. TARDOS, On the knowledge complexity of NP, Combinatorica, 22 (2002), pp. 83-121.
28. A. C. YAO, Protocols for secure computations, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 1982, pp. 160-164.