The DOI matches its Crossref record; 11 of the 11 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.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Anonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
Self-citationAnalyzing and comparing Montgomery multiplication algorithms
Kaya Koc, C., Acar, T., & Kaliski, B. S. (1996) · IEEE Micro · doi:10.1109/40.502403 · Cited by 563
Goldschlag, D. M., Reed, M. G., & Syverson, P. F. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_37 · Cited by 494
Self-citationGulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
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
How to make personalized web browsing simple, secure, and anonymous
Gabber, E., Gibbons, P. B., Matias, Y., & Mayer, A. J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63594-7_64 · Cited by 155
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
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Practical network support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347560 · Cited by 1,127
Díaz, C., Seys, S., Claessens, J., & Preneel, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_5 · Cited by 728
Goldschlag, D., Reed, M., & Syverson, P. (1999) · Communications of the ACM · doi:10.1145/293411.293443 · Cited by 689
Self-citationNetwork support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929847 · Cited by 673
Anonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
Self-citationEnhancing Source-Location Privacy in Sensor Network Routing
Kamat, P., Zhang, Y., Trappe, W., & Ozturk, C. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.31 · Cited by 530
Low-Cost Traffic Analysis of Tor
Murdoch, S. J., & Danezis, G. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.12 · Cited by 517
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Kong, J., & Hong, X. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778449 · Cited by 432
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
Raymond, J.-F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_2 · Cited by 422
Software engineering for security: a roadmap
Devanbu, P. T., & Stubblebine, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336559 · Cited by 418
Source-location privacy in energy-constrained sensor network routing
Ozturk, C., Zhang, Y., & Trappe, W. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029117 · Cited by 390
Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs
Cho, H., Ippolito, D., & Yu, Y. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11511 · Cited by 350
Privacy preservation in wireless sensor networks: A state-of-the-art survey
Li, N., Zhang, N., Das, S. K., & Thuraisingham, B. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.04.009 · Cited by 308
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
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Rennhard, M., & Plattner, B. (2002) · Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society · doi:10.1145/644527.644537 · Cited by 306
Towards an Analysis of Onion Routing Security
Syverson, P., Tsudik, G., Reed, M., & Landwehr, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_6 · Cited by 302
Self-citationTiming 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
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Kus Khalilov, M. C., & Levi, A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2818623 · Cited by 271
Addressing privacy requirements in system design: the PriS method
Kalloniatis, C., Kavakli, E., & Gritzalis, S. (2008) · Requirements Engineering · doi:10.1007/s00766-008-0067-3 · Cited by 269
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
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
Authorship Attribution for Social Media Forensics
Rocha, A., Scheirer, W. J., Forstall, C. W., Cavalcante, T., Theophilo, A., Shen, B., Carvalho, A. R. B., & Stamatatos, E. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2603960 · Cited by 222
Research issues for privacy and security of electronic health services
Yüksel, B., Küpçü, A., & Özkasap, Ö. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2016.08.011 · Cited by 147
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
Laszka, A., Dubey, A., Walker, M., & Schmidt, D. (2017) · Proceedings of the Seventh International Conference on the Internet of Things · doi:10.1145/3131542.3131562 · Cited by 116
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
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
- 11
- 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
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.