Private searching on streaming data

Journal of Cryptology

Volumn 20, Issue 4, 2007, Pages 397-430

  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 keyword search; Private information retrieval; Program obfuscation; Public key encryption with special properties; Public key program obfuscation; Software security

Indexed keywords

CODE OBFUSCATION; DATA STREAMING; PRIVATE SEARCHING; PROGRAM COMPUTATION;

COMPUTATION THEORY; CRYPTOGRAPHY; DATA MINING; DATA PROCESSING; PROBLEM SOLVING; SECURITY OF DATA;

ONLINE SEARCHING;

EID: 36749033301     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-007-0565-3     Document Type: Article

References (29)

1. B. Adida and D. Wikström. Obfuscated Ciphertext Mixing. IACR Eprint archive number 394, 2005.
2. L. Adleman, R. Rivest, and A. Shamir. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM, 21(2):120-126 (February, 1978).
3. 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. LNCS 2139. Springer, Berlin, 2001.
4. J. Bethencourt, D. Song, and B. Waters. New Techniques for Private Stream Searching. Technical Report CMU-CS-06-106, Carnegie Mellon University, March 2006.
5. J. Bethencourt, D. Song, and B. Waters. New Constructions and Practical Applications for Private Stream. Searching (Extended Abstract) Appeared at http://www.cs.cmu.edu/ bethenco/searcheff.pdf July, 2006.
6. D. Boneh, E. Goh, and K. Nissim. Evaluating 2-DNF Formulas on Ciphertexts. In TCC, pages 325-341, 2005.
7. D. Boneh, G. Crescenzo, R. Ostrovsky, and G. Persiano. Public Key Encryption with Keyword Search. EUROCRYPT, pages 506-522, 2004.
8. Y. C. Chang. Single Database Private Information Retrieval with Logarithmic Communication. In ACISP, 2004.
9. C. Cachin, S. Micali, and M. Stadler. Computationally Private Information Retrieval with Polylogarithmic Communication. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, pages 402-414. LNCS 1592. Springer, Berlin, 1999.
10. B. Chor, N. Gilboa, and M. Naor. Private Information Retrieval by Keywords. Technical Report TR CS0917, Department of Computer Science, Technion, 1998.
11. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private Information Retrieval. In Prve. 36th Annu. IEEE Symp. on Foundations of Computer Science, pages 41-51, 1995.
12. Journal version: J. ACM, 45:965-981, 1998.
13. I. Damgård and M. Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Public Key Cryptography (PKC 2001).
14. G. Danezis and C. Diaz Improving the Decoding Efficiency of Private Search. IACR Eprint archive number 024, 2006.
15. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-Database Private Information Retrieval Implies Oblivious Transfer. In Advances in Cryptology - EUROCRYPT 2000, 2000.
16. M. Fredman and J. Komlós. On the Size of Seperarting Systems and Families of Perfect Hash Functions. SIAM J. Algebraic Discrete Methods, 5(1):61-68, March 1984.
17. M. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. To appear in Proc. 2nd Theory of Cryptography Conference (TCC '05) Cambridge, MA, Feb. 2005.
18. S. Goldwasser and S. Micali. Probabilistic Encryption. J. Comput. System Sci., 28(1):270-299, 1984.
19. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Random Structures Algorithms, 7:59-80, 1995.
20. K. Kurosawa and W. Ogata. Oblivious Keyword Search. J. Complexity, 20(2-3):356-371, April/June 2004. Special issue on coding and cryptography.
21. E. Kushilevitz and R. Ostrovsky. Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval. In Proc. 38th Annu. IEEE Symp. on Foundations of Computer Science, pages 364-373, 1997.
22. E. Kushilevitz and R. Ostrovsky. One-way Trapdoor Permutations Are Sufficient for Non-Trivial Single-Database Computationally-Private Information Retrieval. In Proc. EUROCRYPT '00, 2000.
23. H. Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. IACR ePrint Cryptology Archive 2004/063.
24. K. Mehlhorn. On the Program Size of Perfect and Universal Hash Functions. In Proc. 23rd Annu. IEEE Symp. Foundations of Computer Science, pages 170-175, 1982.
25. M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. Proc. 31st STOC, pages 245-254, 1999.
26. R. Ostrovsky and W. Skeith. Algebraic Lower Bounds for Computing on Encrypted Data. Manuscript, 2006.
27. P. Paillier. Public Key Cryptosystems Based on Composite Degree Residue Classes. In Advances in Cryptology - EUROCRYPT '99, pages 223-238. LNCS 1592. Springer-Verlag, Berlin, 1999.
28. T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing For NC1. In Proc. FOCS, pages 554-567, 1999.
29. J. P. Stern. A New and Efficient All or Nothing Disclosure of Secrets Protocol. In Proc. Asiacrypt. Springer-Verlag, Berlin, 1998.