Upper bound on the communication complexity of private information retrieval

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

Volumn 1256, Issue , 1997, Pages 401-407

  Ambainis, Andris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INFORMATION RETRIEVAL;

COMMUNICATION COMPLEXITY; PRIVATE INFORMATION RETRIEVAL; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 84951063457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_196     Document Type: Conference Paper

References (12)

1. M. Abadi, J. Feigenbaum and J. Kilian, On hiding information from an oracle, Journal of Computer and System Sciences, 39(1989), pp. 21-50
2. N. Adam and J. Wortmann, Security control methods for statistical databases: a comparative study, ACM Somputing Surveys, 21(1989), pp. 515-555
3. A. Ambainis, Upper bounds on multiparty communication complexity of shifts, Proceedings of STACS'96, Lecture Notes in Computer Science, vol. 1047(1996), pp. 831-842
4. L. Babai, P. Kimmel, S.V. Lokam, Simultaneous messages versus communication;, Proceedings of STACS!95, Lecture Notes in Computer Science, vol. 900(1995), pp. 361-372
5. R. Beaver, J. Feigenbaum, Hiding instances in multioracle queries, Proceedings of STACS'90, Lecture Notes in Computer Science, vol. 415(1990), pp. 37-48
6. R. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway, Security with low communication overhead, Crypto'90
7. B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan, Private information retrieval, Proceedings of FOCS'95, pp. 41-50. To appear in the Journal of the ACM.
8. D. Denning, Cryptography and Data Security, Addison-Wesley, 1982
9. R. Ostrovsky, V. Shoup, Private information storage, to appear in STOC'97.
10. P. Pudlak, V. Ródł, Modified ranks of tensors and the size of circuits, Proceedings of 25-th ACM STOC, 1993, pp. 523-531. Preliminary version of [11].
11. P. Pudlak, V. Rodl, J. Sgall, Boolean circuits, ranks of tensors and communication complexity, to appear in SIAM J. Computing.
12. J. D. Ullman, Principles of Database Systems. 1982.