The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Mixing E-mail with Babel
Abstract
Increasingly large numbers of people communicate today via electronic means such as email or news forums. One of the basic properties of the current electronic communication means is the identification of the end-points. However, at times it is desirable or even critical to hide the identity and/or whereabouts of the end-points (e.g., human users) involved. This paper discusses the goals and desired properties of anonymous email in general and introduces the design and salient features of Babel anonymous remailer. Babel allows email users to converse electronically while remaining anonymous with respect to each other and to other-even hostile-parties. A range of attacks and corresponding countermeasures is considered. An attempt is made to formalize and quantify certain dimensions of anonymity and untraceable communication.
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
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
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
A First Course in Probability.
Sherman, M. J., & Ross, S. (1984) · Journal of the American Statistical Association · doi:10.2307/2288753 · Cited by 1,344
Network Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
Wall, L., & Loukides, M. (1991) · Cited by 783
A Proposal for a New Block Encryption Standard
Lai, X., & Massey, J. L. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_35 · Cited by 608
Postel, J. B. (1981) · doi:10.17487/rfc0788 · Cited by 506
STANDARD FOR THE FORMAT OF ARPA INTERNET TEXT MESSAGES
Crocker, D. (1982) · doi:10.17487/rfc0822 · Cited by 464
On the design and security of block ciphers
Lai, X. (1992) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-000646711 · Cited by 285
Ziegel, E. R., & Ross, S. (1998) · Technometrics · doi:10.2307/1271207 · Cited by 275
ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Informatik-Fachberichte · doi:10.1007/978-3-642-76462-2_32 · Cited by 216
Linn, J. (1988) · doi:10.17487/rfc1040 · Cited by 172
Networks without user observability
Pfitzmann, A., & Waidner, M. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90087-3 · Cited by 164
Rivest, R. L., & Adi Shamir, Z. (1984) · Communications of the ACM · doi:10.1145/358027.358053 · Cited by 131
Networks Without User Observability — Design Options
Pfitzmann, A., & Waidner, M. (2007) · Springer eBooks · doi:10.1007/3-540-39805-8_29 · Cited by 126
How to Break the Direct RSA-Implementation of Mixes
Pfitzmann, B., & Pfitzmann, A. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_37 · Cited by 114
Schwartz, R. L., Christiansen, T., & Wall, L. (1993) · Cited by 94
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/2229.003.0013 · Cited by 67
Crypto Anarchy and Virtual Communities
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/2229.003.0012 · Cited by 37
Cited by
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
Towards an Information Theoretic Metric for Anonymity
Serjantov, A., & Danezis, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_4 · Cited by 663
Mixminion: design of a type III anonymous remailer protocol
Danezis, G., Dingledine, R., & Mathewson, N. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199323 · Cited by 658
Metadata
- Authors
- Gulcu, C., & Tsudik, G.
- Venue
- Proceedings of Internet Society Symposium on Network and Distributed Systems Security
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-23
- Pages
- 2-16
- OpenAlex
- W1894333397
- Cited by
- 302
- References
- 22
- FWCI
- 19.57
- Type
- conference paper
- Language
- en
- Open access
- closed
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.