Private approximation of clustering and vertex cover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4392 LNCS, Issue , 2007, Pages 383-403

  Beimel, Amos ^a   Hallak, Renen ^a   Nissim, Kobbi ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; INFORMATION ANALYSIS; ONLINE SEARCHING; PROBLEM SOLVING;

PRIVATE APPROXIMATION; SEARCH PROBLEMS;

APPROXIMATION THEORY;

EID: 38049079416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_21     Document Type: Conference Paper

References (22)

1. A. Beimel, P. Carmi, K. Nissim, and E. Weinreb. Private approximation of search problems. In Proc. of the 38th STOC, pages 119-128, 2006.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computations. In Proc. of the 20th STOC pages 1-10, 1988.
3. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SICOMP, 6:305-322, 1977.
4. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In Proc. of the 24th PODS, pages 128-138, 2005.
5. U. Feige, M. Langberg, and K. Nissim. On the hardness of approximating NP witnesses. In 3rd APPROX, volume 1913 of LNCS, pages 120-131. 2000.
6. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. TALG, 2(3):435-472, 2006.
7. 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.
8. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. of the 19th STOC, pages 218-229, 1987.
9. T. F. Gonzalez. Clustering to minimize the maximum inter-cluster distance. TCS, 38:293-306, 1985.
10. S. Halevi, R. Krauthgamer, E. Kushilevitz, and K. Nissim. Private approximation of NP-hard functions. In Proc. of the 33th STOC, pages 550-559, 2001.
11. D. S. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. JACM, 533-550:33, 1986.
12. W. L. Hsu and G. L. Nemhauser. Easy and hard bottleneck location problems. DAM, 1:209-216, 1979.
13. P. Indyk and D. Woodruff. Polylogarithmic private approximations and efficient matching. In TCC 2006, volume 3876 of LNCS, pages 245-264. 2006.
14. O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems, part I: the p-centers. SIAM J. Appl. Math, 37:513-538, 1979.
15. 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.
16. R. Kumar and D. Sivakumar. Proofs, codes, and polynomial-time reducibilities. In Proc. of the 14th CCC, pages 46-53, 1999.
17. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005.
18. J. Plesnik. On the computational complexity of centers locating in a graph. Aplikace Matematiky, 25:445-452, 1980.
19. J. Simon. On the difference between one and many. In Proc. of the 4th ICALP, volume 52 of LNCS, pages 480-491. 1977.
20. L. G. Valiant. A reduction from satisfiability to Hamiltonian circuits that preserves the number of solutions. Manuscript, Leeds, 1974.
21. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. TCS, 47:85-93, 1986.
22. A. C. Yao. Protocols for secure computations. In Proc. of the 23th FOCS, pages 160-164, 1982.