Private information retrieval

Journal of the ACM

Volumn 45, Issue 6, 1998, Pages 965-982

  Chor, Benny ^a   Goldreich, Oded ^b   Kushilevitz, Eyal ^a   Sudan, Madhu ^c,d  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PRIVATE INFORMATION RETRIEVAL;

CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DISTRIBUTED DATABASE SYSTEMS; QUERY LANGUAGES; SECURITY OF DATA;

INFORMATION RETRIEVAL SYSTEMS;

EID: 0032201622     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/293347.293350     Document Type: Article

References (27)

1. ABADI, M., FEIGENBAUM, J., AND KILIAN, J. 1989. On hiding information from an oracle. J. Comput. Syst. Sci. 39, 1, 21-50.
2. ADAM, N., AND WORTMANN, J. 1989. Security-control methods for statistical databases: A comparative study. ACM Comput. Surv. 21, 4 (Dec.), 515-556.
3. AMBAINIS, A. 1997. An upper bound on the communication complexity of private information retrieval. In Proceedings of the 24th ICALP. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 401-407.
4. BABAI, L., KIMMEL, P., AND LOKAM, S. V. 1995. Simultaneous messages vs. communication. In Proceedings of the Symposium on Theoretical Aspects in Computer Science (STACS). Lecture Notes in Computer Science. Springer-Verlag, New York, pp. 361-372.
5. BEAVER, D., AND FEIGENBAUM, J. 1990. Hiding instances in multioracle queries. In Proceedings of the STACS. Lecture Notes in Computer Science, vol. 415. Springer-Verlag, New York, pp. 37-48.
6. BEAVER, D., FEIGENBAUM, J., KILIAN, J., AND ROGAWAY, P. 1991. Security with low communication overhead. In Proceedings of CRYPTO'90. Lecture Notes in Computer Sciences, vol. 537. Springer-Verlag, New York, pp. 62-76.
7. BEAVER, D., FEIGENBAUM, J., KILIAN, J., AND ROGAWAY, P. 1997. Locally random reductions: Improvements and applications. J. Crypt. 10, 1, 17-36.
8. CERI, S., AND PELIGATTI, G. 1984. Distributed database principles & systems. McGraw-Hill, New York.
9. CHIN, F. 1986. Security problems on inference control for SUM, MAX, and MIN queries. J. ACM 33, 3 (July), 451-464.
10. CHOR, B., AND GILBOA, N. 1997. Computationally private information retrieval. In Proceedings of the 29th Annual Symposium on the Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 304-313.
11. CHOR, B., GILBOA, N., AND NAOR, M. 1997. Private information retrieval by keywords. Tech. Rep. TR CS0917. Dept. Comput. Science. Technion, Israel.
12. CHOR, B., GOLDREICH, O., KUSHILEVITZ, E., AND SUDAN, M. 1995. Private information retrieval. In Proceedings of the 36th Annual Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 41-50.
13. DENNING, D. 1982. Crytography and Data Security. Addison-Wesley, Reading, Mass.
14. DOBKIN, D., JONES, A. K., AND LIPTON, R. J. 1979. Secure databases: Protection against user influence. ACM Trans. Datab. Syst. 4, 1 (Mar.), 97-106.
15. FORTNOW, L., AND SZEGEDY, M. 1992. On the power of two-local random reductions. Inf. Proc. Lett. 44, 6, 303-306.
16. GALLAGER, R. G. 1968. Information Theory and Reliable Communication. Wiley, New York.
17. GERTNER, Y., ISHAI, Y., KUSHILEVITZ, E., AND MALKIN, T. 1998. Protecting data privacy in private information retrieval schemes. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 151-160.
18. GOLDREICH, O., AND OSTROVSKY, R. 1996. Software protection and simulation on oblivious RAMs. J. ACM 43, 3 (May), 431-473.
19. HONKALA, I. S. 1991. Modified bounds for covering codes. IEEE Trans. Inf. Theory 37, 2, 351-365.
20. KUSHILEVITZ, E., AND OSTROVSKY, R. 1997. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings of the 38th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 364-373.
21. OSTROVSKY, R., AND SHOUP, V. 1997. Private information storage. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 294-303.
22. PUDLÁK, P., AND RÖDL, V. 1993. Modified ranks of tensors and the size of circuits. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 523-531.
23. PUDLÁK, P., RÖDL, V., AND SGALL, J. 1997. Boolean, circuits, tensor ranks, and communication complexity. SICOMP 26, 605-633.
24. RIVEST, R. L. 1989. Private communication, quoted in the Acknowledgment section of ABADI, ET AL. [1989].
25. RIVEST, R. L., ADLEMAN, L., AND DERTOUZOS, M. L. 1978. On data banks and privacy homomorphisms. In Foundations of Secure Computation, R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, eds. Academic Press, Orlando, Fla.
26. TENDICK, P., AND MATLOFF, N. 1994. A modified random perturbation method for database security. ACM Trans. Datab. Syst. 19, 1 (Mar.), 47-63.
27. ULLMAN, J. D. 1982. Principles of Database Systems, 2nd ed. Computer Science Press, Potomac, Md.