The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Anonymous connections and onion routing
Open accessAbstract
Onion routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Onion routing's anonymous connections are bidirectional, near real-time, and can be used anywhere a socket connection can be used. Any identifying information must be in the data stream carried over an anonymous connection. An onion is a data structure that is treated as the destination address by onion routers; thus, it is used to establish an anonymous connection. Onions themselves appear different to each onion router as well as to network observers. The same goes for data carried over the connections they establish. Proxy-aware applications, such as Web browsers and e-mail clients, require no modification to use onion routing, and do so through a series of proxies. A prototype onion routing network is running between our lab and other sites. This paper describes anonymous connections and their implementation using onion routing. This paper also describes several application proxies for onion routing, as well as configurations of onion routing networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Cited by
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Self-citationCrowds: 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
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307
Timing Attacks in Low-Latency Mix Systems
Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27809-2_25 · Cited by 277
Security models for web-based applications
Joshi, J. B. D., Aref, W. G., Ghafoor, A., & Spafford, E. H. (2001) · Communications of the ACM · doi:10.1145/359205.359224 · Cited by 255
Metadata
- Authors
- Reed, M. G., Syverson, P. F., & Goldschlag, D. M.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1998-05
- Volume
- 16
- Issue
- 4
- Pages
- 482-494
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2005708967
- Cited by
- 1,063
- References
- 1
- FWCI
- 18.82
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Anonymous connections and onion routing. https://app.cochat.ai/papers/10.1109/49.668972
- The paper
- Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998). Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/49.668972
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.