The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Tor: The Second-Generation Onion Router
Abstract
We present Tor, a circuit-based low-latency anonymous communication service. This Onion Routing system addresses limitations in the earlier design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, anticensorship features, guard nodes, application- and user-selectable stream isolation, and a practical design for location-hidden services via rendezvous points. Tor is deployed on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability, and efficiency. An earlier paper in 2004 described Tor’s original design; here we explain Tor’s current design as of late 2012, and describe our experiences with an international network of approximately 3000 nodes and 500000 users. We close with a list of open problems in anonymous communication.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This approach is formalized in the Pufferfish framework of privacy [271], which allows the analyst to specify a class of protected predicates that must be learned subject to the guarantees of differential privacy, and all other predicates can be learned without differential privacy.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [271]
Citations
Cites
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
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
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
Dierks, T., & Allen, C. (1999) · doi:10.17487/rfc2246 · Cited by 1,654
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
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
Self-citationTarzan: a peer-to-peer anonymizing network layer
Freedman, M. J., & Morris, R. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586137 · 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
Self-citationGoldschlag, 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-citationThe NRL Protocol Analyzer: An Overview
Meadows, C. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00095-x · Cited by 459
Web MIXes: A System for Anonymous and Unobservable Internet Access
Berthold, O., Federrath, H., & Köpsell, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_7 · Cited by 395
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnar, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_5 · Cited by 336
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
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-citationPublius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
Fingerprinting Websites Using Traffic Analysis
Hintz, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_13 · Cited by 274
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems
Back, A., Möller, U., & Stiglic, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45496-9_18 · Cited by 232
Using client puzzles to protect TLS
Dean, D., & Stubblefield, A. (2001) · USENIX Security Symposium · Cited by 222
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
Moeller, U. (2004) · Cited by 213
P/sup 5/ : a protocol for scalable anonymous communication
Sherwood, R., Bhattacharjee, B., & Srinivasan, A. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004362 · Cited by 207
Herbivore: A Scalable and Efficient Protocol for Anonymous Communication
Goel, S., Robson, M., Polte, M., & Sirer, E. G. (2003) · eCommons (Cornell University) · Cited by 162
Acquisti, A., Dingledine, R., & Syverson, P. F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45126-6_7 · Cited by 159
Self-citationStatistical Disclosure Attacks
Danezis, G. (2003) · Springer eBooks · doi:10.1007/978-0-387-35691-4_40 · Cited by 139
Limits of Anonymity in Open Environments
Kedogan, D., Agrawal, D., & Penz, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36415-3_4 · Cited by 134
Defending anonymous communications against passive logging attacks
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/secpri.2003.1199325 · Cited by 126
Waldman, M., & Mazières, D. (2001) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/501983.502002 · Cited by 122
Hordes: a multicast based protocol for anonymity1
Levine, B. N., & Shields, C. (2002) · Journal of Computer Security · doi:10.3233/jcs-2002-10302 · Cited by 113
P 5 : A protocol for scalable anonymous communication
Sherwood, R., Bhattacharjee, B., & Srinivasan, A. (2005) · Journal of Computer Security · doi:10.3233/jcs-2005-13602 · Cited by 108
Mix-Networks with Restricted Routes
Danezis, G. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40956-4_1 · Cited by 105
Reliable MIX Cascade Networks through Reputation
Dingledine, R., & Syverson, P. F. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_18 · Cited by 95
Self-citationISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Kommunikation in Verteilten Systemen · Cited by 91
A pseudonymous communications infrastructure for the internet
Goldberg, I., & Brewer, E. (2000) · Cited by 89
Publius: A Robust, Tamper-Evident, Censorship-Resistant, and Source-Anonymous Web Publishing System
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · USENIX Security Symposium · Cited by 89
A Reputation System to Increase MIX-Net Reliability
Dingledine, R., Freedman, M. J., Hopwood, D., & Molnár, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45496-9_10 · Cited by 83
Self-citationReal-time mixes: a bandwidth-efficient anonymity protocol
Jerichow, A., Müller, J., Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668973 · Cited by 82
Pai, V. S., Wang, L., Park, K., Pang, R., & Peterson, L. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972385 · Cited by 70
Practical Anonymity for the Masses with MorphMix
Rennhard, M., & Plattner, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27809-2_24 · Cited by 69
Onion routing access configurations
Syverson, P. F., Reed, M., & Goldschlag, D. M. (2002) · doi:10.1109/discex.2000.824941 · Cited by 66
Self-citationMIXes in mobile communication systems: Location management with privacy
Federrath, H., Jerichow, A., & Pfitzmann, A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61996-8_36 · Cited by 62
EAX: A Conventional Authenticated-Encryption Mode.Preprint
Bellare, M., Rogaway, P., & Wagner, D. A. (2003) · IACR Cryptology ePrint Archive · Cited by 39
Bellare, M., Rogaway, P., & Wagner, D. A. (2004) · Cited by 29
Passive-attack analysis for connection-based anonymity systems
Serjantov, A., & Sewell, P. (2005) · International Journal of Information Security · doi:10.1007/s10207-004-0059-3 · Cited by 26
Protocols using Anonymous Connections: Mobile Applications
Reed, M., Syverson, P. F., & Goldschlag, D. M. (1997) · doi:10.21236/ada465486 · Cited by 21
Self-citationAnalysis of an anonymity network for web browsing
Rennhard, M., Rafaeli, S., LaurentMathy, Plattner, B., & Hutchison, D. (2003) · IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/enabl.2002.1029987 · Cited by 18
Using caching for browsing anonymity
Shubina, A., & Smith, S. W. (2003) · ACM SIGecom Exchanges · doi:10.1145/1120709.1120713 · Cited by 11
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Zerocash: Decentralized Anonymous Payments from Bitcoin
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.36 · Cited by 1,925
Bitcoin: Economics, Technology, and Governance
Böhme, R., Christin, N., Edelman, B., & Moore, T. (2015) · Journal of Economic Perspectives · doi:10.1257/jep.29.2.213 · Cited by 1,823
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Metadata
- Authors
- Dingledine, R., Mathewson, N., & Syverson, P.
- Affiliations
- United States Naval Research Laboratory (US)
- Publisher
- Defense Technical Information Center
- Published
- 2004-01-01
- OpenAlex
- W1655958391
- Cited by
- 4,104
- References
- 46
- Citations by year
- 2026: 85 · 2025: 162 · 2024: 167 · 2023: 176 · 2022: 158 · 2021: 195 · 2020: 191 · 2019: 167 · 2018: 221 · 2017: 215 · 2016: 264 · 2015: 280 · 2014: 256 · 2013: 253 · 2012: 270
- Type
- report
- Language
- en
- Open access
- closed
- Locations
- Defense Technical Information Center (DTIC) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Keywords
- Tor, onion routing, anonymous communication, forward secrecy, congestion control, directory servers, integrity verification, exit policy, rendezvous points, anonymity, network latency
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.