Private searching on streaming data

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

Volumn 3621 LNCS, Issue , 2006, Pages 223-240

  Ostrovsky, Rafail ^a   Skeith III, William E ^b  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Code Obfuscation; Crypto computing; Database security; Privacy Preserving Datamining; Privacy Preserving Keyword Search; Private Information Retrieval; Public key Encryption with special properties; Secure Algorithms for Streaming Data; Software security

Indexed keywords

CODE OBFUSCATION; CRYPTO-COMPUTING; DATABASE SECURITY; PRIVACY-PRESERVING DATAMINING; PRIVACY-PRESERVING KEYWORD SEARCH; PRIVATE INFORMATION RETRIEVAL; PUBLIC-KEY ENCRYPTION WITH SPECIAL PROPERTIES; SECURE ALGORITHMS FOR STREAMING DATA; SOFTWARE SECURITY;

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; DATA ACQUISITION; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 33745177806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of software obfuscation. In Crypto 2001, pages 1-18, 2001. LNCS 2139.
2. D. Boneh, E. Goh, K. Nissim. Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325-341
3. D. Boneh, G. Crescenzo, R. Ostrovsky, G. Persiano. Public Key Encryption with Keyword Search. EUROCRYPT 2004: 506-522
4. Y. C. Chang. Single Database Private Information Retrieval with Logarithmic Communication. ACISP 2004
5. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 402-414. Springer, 1999.
6. B. Chor, N. Gilboa, M. Naor Private Information Retrieval by Keywords in Technical Report TR CS0917, Department of Computer Science, Technion, 1998.
7. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. of the 36th Annu. IEEE Symp. on Foundations of Computer Science, pages 41-51, 1995.
8. Journal version: J. of the ACM, 45:965-981, 1998.
9. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000, 2000.
10. I. Damgård, M. Jurik. A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. In Public Key Cryptography (PKC 2001)
11. M. Freedman, Y. Ishai, B. Pinkas and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. To appear in 2nd Theory of Cryptography Conference (TCC '05) Cambridge, MA, Feb 2005.
12. S. Goldwasser and S. Micali. Probabilistic encryption. In J. Comp. Sys. Sci, 28(1):270-299, 1984.
13. K. Kurosawa, W. Ogata. Oblivious Keyword Search. Journal of Complexity, Volume 20, Issue 2-3 April/June 2004 Special issue on coding and cryptography Pages: 356-371
14. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science, pages 364-373, 1997.
15. E. Kushilevitz and R. Ostrovsky. One-way Trapdoor Permutations are Sufficient for Non-Trivial Single-Database Computationally-Private Information Retrieval. In Proc. of EUROCRYPT '00, 2000.
16. H. Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. IACR ePrint Cryptology Archive 2004/063
17. K. Mehlhorn. On the Program Size of Perfect and Universal Hash Functions. In Proc. 23rd annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 170-175.
18. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proc. 31st STOC, pp. 245-254, 1999.
19. P. Paillier. Public Key Cryptosystems based on Composite Degree Residue Classes. Advances in Cryptology - EUROCRYPT '99, LNCS volume 1592, pp. 223-238. Springer Verlag, 1999.
20. T. Sander, A. Young, M.Yung. Non-Interactive CryptoComputing For NC1 FOCS 1999: 554-567
21. J.P. Stern, A New and Efficient All or Nothing Disclosure of Secrets Protocol Asiacrypt 1998 Proceedings, Springer Verlag.