Receiver anonymity via incomparable public keys

Authors:
Brent R. Waters;Edward W. Felten;Amit Sahai
Affiliations:
Princeton University, Princeton, NJ;Princeton University, Princeton, NJ;Princeton University, Princeton, NJ
Venue:
Proceedings of the 10th ACM conference on Computer and communications security
Year:
2003

Citing 13
Cited 12

A public key cryptosystem and a signature scheme based on discrete logarithms

Proceedings of CRYPTO 84 on Advances in cryptology
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Public-key cryptosystems provably secure against chosen ciphertext attacks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The design, implementation and operation of an email pseudonym server

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
Onion routing

Communications of the ACM
A protocol for anonymous communication over the Internet

Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
SKEME: a versatile secure key exchange mechanism for Internet

SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
P5: A Protocol for Scalable Anonymous Communication

SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Can pseudonymity really guarantee privacy?

SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9

Reusable anonymous return channels

Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Privacy management for portable recording devices

Proceedings of the 2004 ACM workshop on Privacy in the electronic society
MuON: Epidemic based mutual anonymity in unstructured P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey on anonymity in unstructured peer-to-peer systems

Journal of Computer Science and Technology
Cross-layer enhanced source location privacy in sensor networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
One-time receiver address in IPv6 for protecting unlinkability

ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Combining incomparable public session keys and certificateless public key cryptography for securing the communication between grid participants

OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
An efficient incomparable public key encryption scheme

Information Sciences: an International Journal
Decentralized generation of multiple, uncorrelatable pseudonyms without trusted third parties

TrustBus'11 Proceedings of the 8th international conference on Trust, privacy and security in digital business
Pseudonymous PKI for ubiquitous computing

EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
How to securely outsource cryptographic computations

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A new k-anonymous message transmission protocol

WISA'04 Proceedings of the 5th international conference on Information Security Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity for receivers (although those methods do protect sender anonymity). Our method relies on the use of multicast, along with a novel cryptographic primitive that we call an Incomparable Public Key cryptosystem, which allows a receiver to efficiently create many anonymous "identities" for itself without divulging that these separate "identities" actually refer to the same receiver, and without increasing the receiver's workload as the number of identities increases. We describe the details of our method, along with a prototype implementation.