Efficiency Improvements of the Private Message Service

Authors:
Oliver Berthold;Sebastian Clauß;Stefan Köpsell;Andreas Pfitzmann
Affiliations:
-;-;-;-
Venue:
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Year:
2001

Citing 10
Cited 3

Networks without user observability

Computers and Security
Towards a theory of software protection and simulation by oblivious RAMs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMS

Software protection and simulation on oblivious RAMS
Software protection and simulation on oblivious RAMs

Journal of the ACM (JACM)
Private information storage (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The design and implementation of a private message service for mobile computers

Wireless Networks
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Private information retrieval

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Preserving privacy in a network of mobile computers

SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy

The pynchon gate: a secure method of pseudonymous mail retrieval

Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Dummy traffic against long term intersection attacks

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Unobservable surfing on the world wide web: is private information retrieval an alternative to the MIX based approach?

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies

Quantified Score

Hi-index	0.00

Visualization

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 ZN (N 驴 2) and prove the security of blinded read.