Abstract
We construct a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1)).
Computer Science Division, University of California at Berkeley.
The author was supported by Latvia Science Council Grant 96.0282 and scholarship “SWH Izglītībai, Zinātnei un Kultūrai” from Latvia Education Foundation
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, J. Feigenbaum and J. Kilian, On hiding information from an oracle, Journal of Computer and System Sciences, 39(1989), pp. 21–50
N. Adam and J. Wortmann, Security control methods for statistical databases: a comparative study, ACM Somputing Surveys, 21(1989), pp. 515–555
A. Ambainis, Upper bounds on multiparty communication complexity of shifts, Proceedings of STACS'96, Lecture Notes in Computer Science, vol. 1047(1996), pp. 631–642
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
R. Beaver, J. Feigenbaum, Hiding instances in multioracle queries, Proceedings of STACS'90, Lecture Notes in Computer Science, vol. 415(1990), pp. 37–48
R. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway, Security with low communication overhead, Crypto'90
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.
D. Denning, Cryptography and Data Security, Addison-Wesley, 1982
R. Ostrovsky, V. Shoup, Private information storage, to appear in STOC'97.
P. Pudlak, V. Rödl, Modified ranks of tensors and the size of circuits, Proceedings of 25-th ACM STOC, 1993, pp. 523–531. Preliminary version of [11].
P. Pudlak, V. Rödl, J. Sgall, Boolean circuits, ranks of tensors and communication complexity, to appear in SIAM J. Computing.
J. D. Ullman, Principles of Database Systems. 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambainis, A. (1997). Upper bound on the communication complexity of private information retrieval. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_196
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_196
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive