Private approximation of search problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 119-128

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

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; CRYPTOGRAPHY; INFORMATION ANALYSIS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; CRYPTOGRAPHIC APPLICATIONS; OPTIMAL SOLUTIONS; SEARCH PROBLEMS;

COMPUTATION THEORY;

EID: 33748093542     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132533     Document Type: Conference Paper

References (26)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures & Alg., 3:289-304, 1992.
3. R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky. Privacy, additional information, and communication. IEEE Trans. on Information Theory, 39(6):1930-1943, 1993.
4. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Disc. Math., 25:27-46, 1985.
5. A. Beimel, P. Carmi, K. Nissim, and E. Weinreb. Private approximation of search problems. Technical Report TR05-141, ECCC, 2005.
6. M. Bellare and E. Petrank. Making zero-knowledge provers efficient. In the 24th STOC, pages 711-722, 1992.
7. B. Chor, J. Friedmann, O. Goldreich, J. Håstad, S. Rudich, and R. Smolansky. The bit extraction problem or t-resilient functions. In the 26th FOCS, pages 396-407, 1985.
8. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Math., 162(1), 2005.
9. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. In the 28th ICALP, volume 2076 of LNCS, pages 927-938, 2001.
10. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In EUROCRYPT 2004, volume 3027 of LNCS, pages 1-19, 2004.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In the 19th STOC, pages 218-229, 1987.
12. O. Goldreich, R. Ostrovsky, and E. Petrank. Computational complexity and knowledge complexity. SIAM J. on Computing, 21(4):1116-1141, 1998.
13. O. Goldreich and E. Petrank. Quantifying knowledge complexity. Computational Complexity, 8(1):50-98, 1999.
14. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. on Computing, 18(1):186-208, 1989.
15. S. Halevi, R. Krauthgamer, E. Kushilevitz, and K. Nissim. Private approximation of NP-hard functions. In the 33th STOC pages 550-559, 2001.
16. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In the 11th SODA, pages 329-337, 2000.
17. J. Håstad. Some optimal inapproximability results. J. of the ACM, 48(4):798-859, 2001.
18. P. Indyk and D. Woodruff. Polylogarithmic private approximations and efficient matching. TCC 2006, volume 3876 of LNCS, pages 245-264, 2006.
19. D. S. Johnson. Approximation algorithms for combinatorial problems. JCSS, 9:256-278, 1974.
20. E. Kiltz, G. Leander, and J. Malone-Lee. Secure computation of the mean and related statistics. In TCC 2005, volume 3378 of LNCS, pages 283-302, 2005.
21. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. on Computing, 15(4):1036-1055, 1986.
22. B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inf., 22:115-123, 1985.
23. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. on Computing, 22(4):838-856, 1993.
24. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. JCSS, 53(2):161-170, 1996.
25. E. Petrank and G. Tardos. On the knowledge complexity of NP. Combinatorica, 22(1):83-121, 2002.
26. A. C. Yao, Protocols for secure computations. In the 23th FOCS, pages 160-164, 1982.