How should we solve search problems privately?

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

Volumn 4622 LNCS, Issue , 2007, Pages 31-49

  Beimel, Amos ^a   Malkin, Tal ^b   Nissim, Kobbi ^a   Weinreb, Enav ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Columbia University ^*  (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; PROBLEM SOLVING; SEARCH ENGINES;

ALGORITHMIC MACHINERY; PRIVATE COMPUTATION; SEARCH PROBLEM;

SECURITY OF DATA;

EID: 38049100196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_3     Document Type: Conference Paper

References (19)

1. Beimel, A., Carmi, P., Nissim, K., Weinreb, E.: Private approximation of search problems. In: Proc. of the 38th Symp. on the Theory of Comp. pp. 119-128 (2006)
2. Beimel, A., Hallak, R., Nissim, K.: Private approximation of clustering and vertex cover. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 383-403. Springer, Heidelberg (2007)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th Symp. on the Theory of Comp. pp. 1-10 (1988)
4. Berlekamp, E.R: Factoring polynomials over large finite fields. Math. Comp. 24, 713-735 (1970)
5. Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997, pp. 21-29 (1997)
6. Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. J. of Computer and System Sciences 60(3), 630-659 (2000)
7. Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. In: Proc. of World Wide Web conference, pp. 1157-1166 (1997)
8. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th Symp. on the Theory of Comp. pp. 11-19 (1988)
9. Dias, V.M.F., da Fonseca, G.D., de Figueiredo, C.M.H., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theoretical Computer Science 306(1-3), 391-405 (2003)
10. Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 927-938. Springer, Heidelberg (2001)
11. Franklin, M., Gondree, M., Mohassel, P.: Improved efficiency for private stable matching. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 163-177. Springer, Heidelberg (2006)
12. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9-15 (1962)
13. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM 33(4), 792-807 (1986)
14. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th Symp. on the Theory of Comp. pp. 218-229 (1987)
15. Golle, P.: A private stable matching algorithm. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 65-80. Springer, Heidelberg (2006)
16. Halevi, S., Krauthgamer, R., Kushilevitz, E., Nissim, K.: Private approximation of NP-hard functions. In: Proc. of the 33th Symp. on the Theory of Comp. pp. 550-559 (2001)
17. Indyk, P., Woodruff, D.: Poly logarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 245-264. Springer, Heidelberg (2006)
18. Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. of the ACM 51(4), 671-697 (2004)
19. Yao, A.C.: Protocols for secure computations. In: Proc. of the 23th IEEE Symp. on Foundations of Computer Science, pp. 160-164. IEEE Computer Society Press, Los Alamitos (1982)