Abstract
Based on the private message service described in [4] we show efficiency improvements of that private message service in the computational setting. Regarding an attacker which may control all but one of the queried servers we describe a private message service with a total communication complexity of blinded read between client and private message service of n bit upstream and k bit downstream, where n denotes the number of cells in the database and k the size of one cell. Apart from a registration mechanism, the communication complexity between client and service is independent of the number of queried servers. Our improvement of the private message service is not only extremely efficient in terms of communication, but also in terms of computation. Further we describe how to use the message service in case of messages which are addressed using visible implicit addresses. After that we prove that at least parts of messages which are addressed using invisible implicit addresses must be broadcasted.
We generalize the message service to operations in itℤn (N ≥ 2) and prove the security of blinded read.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Ambainis. Upper Bound on the Communication Complexity of Private Information Retrieval. 24th International Collocquium on Automata, Languages and Programming (ICALP), LNCS 1256, Springer-Verlag, Berlin 1997, 401–407
B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan. Private Information Retrieval. 36th Annual Symposium on Foundations of Computer Sience (FOCS) 1995, IEEE Computer Society, 1995, 41–50
B. Chor and N. Gilboa. Computationally Private Information Retrieval. 29th Symposium on Theory of Computing (STOC) 1997, ACM, New York 1997, 304–313
D. A. Cooper, K. P. Birman. Preserving Privacy in a Network of Mobile Computers. 1995 IEEE Symposium on Research in Security and Privacy, IEEE Computer Society Press, Los Alamitos 1995, 26–38
D. A. Cooper, K. P. Birman. The design and implementation of a private message service for mobile computers. Wireless Networks 1, 1995, 297–309
G. Di Crescenzo, Y. Ishai, R. Ostrovsky. Universal Service-Providers for Private Information Retrieval. Journal of Cryptology 14, 2001, 37–74
O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In Proc. 19th Annual ACM Symp. Theory Comp., 1987
O. Goldreich, R. Ostrovsky. Software protection and simulation by oblivious RAMs. JACM, 1996
R. Ostrovsky. Software protection and simulation on oblivious RAMs. M. I. T. Ph. D. Thesis in Computer Sience, June 1992. Preliminary version in Proc. 22nd Annual ACM Symp. Theory Comp., 1990
R. Ostrovsky, V. Shoup. Private Information Storage. 29th Symposium on Theory of Computing (STOC) 1997, ACM, New York 1997, 294–303
A. Pfitzmann, M. Waidner: Networks without user observability. Computers & Security 6/2, 1987, 158–166
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthold, O., Clauß, S., Köpsell, S., Pfitzmann, A. (2001). Efficiency Improvements of the Private Message Service. In: Moskowitz, I.S. (eds) Information Hiding. IH 2001. Lecture Notes in Computer Science, vol 2137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45496-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-45496-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42733-9
Online ISBN: 978-3-540-45496-0
eBook Packages: Springer Book Archive