The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Untraceable electronic mail, return addresses, and digital pseudonyms
Open accessAbstract
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 untraceble return address.The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications.Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms.Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters.Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym which appears in a roster of acceptable clients.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
Research works printed but not linked: 2
- Baran , P. On distributed communications: IX security secrecy and tamper-free considerations. Memo RM-3765-PR , Rand Corp. , Santa Monica, CA , Aug. 1964 . Baran, P. On distributed communications: IX security secrecy and tamper-free considerations. Memo RM-3765-PR, Rand Corp., Santa Monica, CA, Aug. 1964.
- Kahn , D. The Code Breakers , The Story of Secret Writing . Macmillan , New York , 1967 . Kahn, D. The Code Breakers, The Story of Secret Writing. Macmillan, New York, 1967.
Cited by
Items 101–113 of 113
Data retention and the panoptic society: the social benefits of forgetfulness
Blanchette, J.-F., & Johnson, D. G. (2002) · The Information Society · doi:10.1080/01972240252818216 · Cited by 178
Statistical Disclosure or Intersection Attacks on Anonymity Systems
Danezis, G., & Serjantov, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30114-1_21 · Cited by 131
Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed Learning
Ma, C., Li, J., Wei, K., Liu, B., Ding, M., Yuan, L., Han, Z., & Vincent Poor, H. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2023.3306773 · Cited by 96
Privacy in Bitcoin Transactions: New Challenges from Blockchain Scalability Solutions
Herrera-Joancomartí, J., & Pérez-Solà, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-45656-0_3 · Cited by 85
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Formal Treatment of Privacy-Enhancing Credential Systems
Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G. L., Neven, G., & Pedersen, M. Ø. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31301-6_1 · Cited by 65
“PABCs were first envisioned by Chaum [16,27], and they have been a vivid area of research over the last decade.”
Background(2011) · Cited by 65
Private Stateful Information Retrieval
Patel, S., Persiano, G., & Yeo, K. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243821 · Cited by 61
“That is, the adversary cannot learn the identity of the querying clients which can be enforced by requiring clients to use anonymous mix networks [16].”
BackgroundA Trusted Approach for Decentralised and Privacy-Preserving Identity Management
Moreno, R. T., Garcia-Rodriguez, J., Bernabe, J. B., & Skarmeta, A. (2021) · IEEE Access · doi:10.1109/access.2021.3099837 · Cited by 33
“This paper presents a solution relying on distributed technologies and privacy-preserving Attribute-Based Credentials (P-ABC) [11], [12].”
MethodDecentralizing Digital Identity: Open Challenges for Distributed Ledgers
Dunphy, P., Garratt, L., & Petitcolas, F. (2018) · 2018 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) · doi:10.1109/eurospw.2018.00016 · Cited by 26
A key management-based two-level encryption method for AMI
Parvez, I., Islam, A., & Kaleem, F. (2014) · 2014 IEEE PES General Meeting | Conference & Exposition · doi:10.1109/pesgm.2014.6939551 · Cited by 24
Why Do People Sometimes Wear an Anonymous Mask? Motivations for Seeking Anonymity Online
Nitschinsk, L., Tobin, S. J., Varley, D., & Vanman, E. J. (2025) · Personality and Social Psychology Bulletin · doi:10.1177/01461672231210465 · Cited by 22
The OLYMPUS Architecture—Oblivious Identity Management for Private User-Friendly Services
Torres Moreno, R., Bernal Bernabe, J., García Rodríguez, J., Kasper Frederiksen, T., Stausholm, M., Martínez, N., Sakkopoulos, E., Ponte, N., & Skarmeta, A. (2020) · Sensors · doi:10.3390/s20030945 · Cited by 15
Metadata
- Authors
- Chaum, D. L.
- Venue
- Communications of the ACM
- Published
- 1981-02
- Volume
- 24
- Issue
- 2
- Pages
- 84-90
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2103647628
- Cited by
- 4,289
- References
- 4
- FWCI
- 1.16
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.