Untraceable electronic mail, return addresses, and digital pseudonyms

@article{Chaum1981UntraceableEM,
  title={Untraceable electronic mail, return addresses, and digital pseudonyms},
  author={David Chaum},
  journal={Commun. ACM},
  year={1981},
  volume={24},
  pages={84-88}
}
  • D. Chaum
  • Published 1 February 1981
  • Computer Science
  • Commun. ACM
A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address. The technique can also be used to form rosters of untraceable… 
View on ACM
cs.utexas.edu
3,478 Citations
Highly Influential Citations
171
Background Citations
1,134
Methods Citations
390
Results Citations
12

3,478 Citations

Citation Type

Citation Type

Cryptographic protocols: revocable anonymity and e-voting
TLDR
An electronic voting protocol supporting write-in ballots is designed, which satisfies both uncoercibility and verifiability, among other key requirements, and does not require any computational power from the voter, which makes it the first such protocol.
Certified Pseudonyms Colligated with Master Secret Key
TLDR
A system that allows users to create pseudonyms from a trusted master public-secret key pair based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes.
AN APPROACH TO REVOKE BLACKLISTED ANONYMOUS CREDENTIAL USERS THROUGH TTP
TLDR
This paper significantly makes an attempt to generalize the basic form of revocation amounting to “revoke anybody on the blacklist” immediately through its proposed scheme.
Electronic Identities Need Private Credentials
TLDR
Solutions such as the Security Assertion Markup Language, OpenID, or X.509 certificates let users authenticate and transfer attributes, certified by an issuer, to a relying party in a more trusted way, but these technologies still have considerable security and privacy concerns.
Unique User-Generated Digital Pseudonyms
TLDR
Each user can now generate his pseudonym locally in his personal security environment, e.g. in his smart card or his personal digital assistant, with no need for any information interchange between issuing parties or global data, except unique identifiers for each user and each device of the system.
Accountable Anonymity: A Proxy Re-Encryption Based Anonymous Communication System
TLDR
This paper proposes an efficient proxy re-encryption based design that allows normal activities to be done in anonymous manner, while keeping malicious/criminal operations accountable at the same time, and is one of the first attempts trying to achieve both accountability and anonymity.
An untraceable , universally verifiable voting scheme
TLDR
A technique called blinded signatures is applied to a voter’s ballot so that it is impossible for anyone to trace the ballot back to the voter.
Secure Anonymous Communications with Practical Anonymity Revocation Scheme
TLDR
An anonymous communication scheme using a multistage cryptographic anonymous proxy to make malicious users traceable and identify an illegal anonymous user or his accomplice who joins a conspiracy if a threshold number of third parties or more agrees on anonymity revocation.
Simple and efficient hash-based verifiable mixing for remote electronic voting
Security enhanced accountable anonymous PKI certificates for mobile e-commerce
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
A method for obtaining digital signatures and public-key cryptosystems
TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Secure communications over insecure channels
TLDR
This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained, and describes a method which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key.
ON DISTRIBUTED COMMUNICATIONS: IX. SECURITY, SECRECY, AND TAMPER-FREE CONSIDERATIONS,
TLDR
The premise that the existence of ''spies'' within the supposedly secure system must be anticipated is evaluated, and the safeguards to be built into the network are described.
New directions in cryptography
TLDR
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
The codebreakers : the story of secret writing
CONTENTS Preface to the Revised Edition Preface A Few Words 1. One Day of Magic THE PAGENT OF CRYPTOLOGY 2. The First 3,000 Years 3. The Rise of the West 4. On the Origin of a Species 5. The Era of…
IEEE Trans. Information Theory 1T
  • IEEE Trans. Information Theory 1T
  • 1976
A1: [K<A1>( R<A1>, A2 )], [Inv(R<A1>)( K<A2>( R<A2>, A3 ))], ..., [Inv(R<A1>)( Inv(R<A2>) ... Inv(R<A<n-1>>)( K<An>( R<An>, Ax ))...)], [M1], [M2], ..., [M<l-n>
  • A1: [K<A1>( R<A1>, A2 )], [Inv(R<A1>)( K<A2>( R<A2>, A3 ))], ..., [Inv(R<A1>)( Inv(R<A2>) ... Inv(R<A<n-1>>)( K<An>( R<An>, Ax ))...)], [M1], [M2], ..., [M<l-n>