Tor: The Second-Generation Onion Router
The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
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 · cited 2×
“Many of the open problems in low-latency anonymity networks, such as generating dummy traffic or preventing Sybil attacks [22], may be solvable independently from the issues solved by Tor.”
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 · cited 5×
“While Tarzan and MorphMix use layered encryption as above, Crowds [42] simply assumes an adversary who cannot observe the initiator: it uses no public-key encryption, so any node on a circuit can read users’ traffic.”
InfluentialDierks, T., & Allen, C. (1999) · doi:10.17487/rfc2246 · Cited by 1,654 · cited 14×
“The identity key is used to sign TLS certificates, to sign the OR’s router descriptor (a summary of its keys, address, bandwidth, exit policy, and so on), and (by directory servers) to sign directories.”
InfluentialWide-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 · cited 3×
“They may intercept IP packets directly, and relay them whole (stripping the source address) along the circuit [8, 24].”
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 · cited 2×
“All of these approaches limit exposure even when some selected users collude in the DoS.”
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 · cited 3×
“No mixing, padding, or traffic shaping (yet): Onion Routing originally called for batching and reordering cells as they arrived, assumed padding between ORs, and in later designs added padding between onion proxies (users) and ORs [27, 41].”
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
Cited by
Items 701–800 of 1,001
Slicing the Onion: Anonymous Routing Without PKI
Katti, S., Katabi, D., & Puchala, K. (2005) · Cited by 35
Quantifying Resistance to the Sybil Attack
Margolin, N. B., & Levine, B. N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85230-8_1 · Cited by 40
“As a concrete example of protocol analysis using the Sybil valuation, we evaluate a Recurring Fee Onion Routing protocol, which we refer to as RFOR to distinguish it from Onion Routing or the deployed Tor protocol [16], which operates without explicit or implicit recurring fees.”
BackgroundMethodHow Low Can You Go: Balancing Performance with Anonymity in Tor
Geddes, J., Jansen, R., & Hopper, N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39077-7_9 · Cited by 35
A survey on the design, applications, and enhancements of application-layer overlay networks
Kurian, J., & Saraç, K. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824800 · Cited by 39
“In this section, we brie.y look at Tor [Dingledine et al. 2004] a second-generation onion router [Goldschlag et al. 1999].”
BackgroundInfluentialNovel Packet Size-Based Covert Channel Attacks against Anonymizer
Ling, Z., Fu, X., Jia, W., Yu, W., Dong, X., & Luo, J. (2012) · IEEE Transactions on Computers · doi:10.1109/tc.2012.169 · Cited by 38
Smits, R. A. M. M., Jain, D., Pidcock, S., Goldberg, I., & Hengartner, U. (2011) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2046556.2046569 · Cited by 35
Anon-Pass: Practical Anonymous Subscriptions
Lee, M. Z., Dunn, A. M., Waters, B. R., Witchel, E., & Katz, J. I. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.29 · Cited by 39
Anonymous Networking with Minimum Latency in Multihop Networks
Venkitasubramaniam, P., & Tong, L. (2008) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2008.18 · Cited by 38
Never been KIST: Tor's congestion management blossoms with Kernel-informed socket transport
Jansen, R., Geddes, J., Wacek, C., Sherr, M., & Syverson, P. F. (2014) · Cited by 35
Self-citationDetecting and blocking onion router traffic using deep packet inspection
Saputra, F. A., Nadhori, I. U., & Barry, B. F. (2016) · International Electronics Symposium (IES) · doi:10.1109/elecsym.2016.7861018 · Cited by 40
CryptoKnight: Generating and Modelling Compiled Cryptographic Primitives
Hill, G., & Bellekens, X. (2018) · Information · doi:10.3390/info9090231 · Cited by 39
SoK: Content Moderation for End-to-End Encryption
Scheffler, S., & Mayer, J. R. (2023) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2023-0060 · Cited by 52
Targeted Advertising on the Handset: Privacy and Security Challenges
Haddadi, H., Hui, P., Henderson, T., & Brown, I. (2011) · Human-computer interaction series · doi:10.1007/978-0-85729-352-7_6 · Cited by 37
Bellavista, P., Antonio Corradi, A., & Giannelli, C. (2005) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs.2005.1547662 · Cited by 35
A survey on solutions and main free tools for privacy enhancing Web communications
Ruiz‐Martínez, A. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.02.011 · Cited by 35
(2014) · Cited by 35
Insoll, T., Ovaska, A. K., Nurmi, J., Aaltonen, M., & Vaaranen-Valkonen, N. (2022) · Journal of Online Trust and Safety · doi:10.54501/jots.v1i2.29 · Cited by 34
A Secure Network for Mobile Wireless Service
Peng, K. (2013) · Journal of Information Processing Systems · doi:10.3745/jips.2013.9.2.247 · Cited by 34
A3: An Extensible Platform for Application-Aware Anonymity
Sherr, M., Mao, A., Marczak, W. R., Zhou, W., Loo, B. T., Sherr, M., Marczak, W. R., Zhou, W., & Th, B. (2010) · ScholarlyCommons (University of Pennsylvania) · Cited by 34
Message in a bottle: sailing past censorship
Invernizzi, L., Kruegel, C., & Vigna, G. (2013) · Annual Computer Security Applications Conference · doi:10.1145/2523649.2523654 · Cited by 36
ANONIZE: A Large-Scale Anonymous Survey System
Hohenberger, S., Myers, S., Pass, R., & Shelat, A. A. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.31 · Cited by 46
“In moderate-security settings, proxy services can be used to transmit the data, and in high-security settings, onionrouting such as TOR [38] may be used.”
Tracking Users on the Internet with Behavioral Patterns: Evaluation of Its Practical Feasibility
Banse, C., Herrmann, D., & Federrath, H. (2012) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-3-642-30436-1_20 · Cited by 36
“ON (JonDonym) [11, 4] that hide communication patterns from eavesdroppers.”
BackgroundA Cloud-Based eHealth Architecture for Privacy Preserving Data Integration
Dubovitskaya, A., Urovi, V., Vasirani, M., Aberer, K., & Schumacher, M. (2015) · IFIP advances in information and communication technology · doi:10.1007/978-3-319-18467-8_39 · Cited by 39
“A straightforward countermeasure is to hide the IP address from the cloud server, e.g., using HTTP proxies or anonymous communication service like Tor [7].”
MethodExploring Malicious Hacker Forums
Shakarian, J., Gunn, A., & Shakarian, P. (2016) · Springer eBooks · doi:10.1007/978-3-319-32699-3_11 · Cited by 34
Polynomial Batch Codes for Efficient IT-PIR
Henry, R. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0036 · Cited by 39
Information-Theoretic Secure Multi-Party Computation With Collusion Deterrence
Wang, Z., Cheung, S.-C. S., & Luo, Y. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2598533 · Cited by 34
Website Fingerprinting with Website Oracles
Pulls, T., & Dahlberg, R. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0013 · Cited by 46
“Compared to most VPN implementations, Tor has some basic but rather ineffective defenses in place against WF attacks, such as padding packets to a constant size and randomized HTTP request pipelining [8, 20, 70].”
BackgroundMethodInfluentialDARVAN: A fully decentralized anonymous and reliable routing for VANets
Monfared, S. K., & Shokrollahi, S. (2023) · Computer Networks · doi:10.1016/j.comnet.2023.109561 · Cited by 39
Filtering for Private Collaborative Benchmarking
Kerschbaum, F., & Terzidis, O. (2006) · Lecture notes in computer science · doi:10.1007/11766155_29 · Cited by 35
Online subscriptions with anonymous access
Blanton, M. (2008) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1368310.1368342 · Cited by 34
Kelly, D., Raines, R. A., Baldwin, R. O., Grimaila, M. R., & Mullins, B. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.042011.00080 · Cited by 34
Large-scale collection and sanitization of network security data: risks and challenges
Porras, P. A., & Shmatikov, V. (2006) · New Security Paradigms Workshop · doi:10.1145/1278940.1278949 · Cited by 38
Usable Optimistic Fair Exchange
Küpçü, A., & Lysyanskaya, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11925-5_18 · Cited by 38
We saw each other on the subway
Manweiler, J., Scudellari, R., Cancio, Z., & Cox, L. P. (2009) · IEEE Workshop on Mobile Computing Systems and Applications (WMCSA) · doi:10.1145/1514411.1514412 · Cited by 34
Low-Cost Side Channel Remote Traffic Analysis Attack in Packet Networks
Kadloor, S., Gong, X., Kiyavash, N., Tezcan, T., & Borisov, N. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5501972 · Cited by 34
(2011) · Cited by 34
Tor Marketplaces Exploratory Data Analysis: The Drugs Case
Celestini, A., Me, G., & Mignone, M. (2016) · Communications in computer and information science · doi:10.1007/978-3-319-51064-4_18 · Cited by 34
“Anonymity of both administrators and participants is ensured by the use of different technologies: electronic payments are carried out through the use of the virtual cryptocurrencies (Bitcoin is the most popular of near 100 cryptocurrencies), Tor is used for network communication and the Pretty Good Privacy (PGP) crypt…”
MethodInfluentialScalable Anonymous Group Communication in the Anytrust Model
Wolinsky, D. I., Corrigan-Gibbs, H., Ford, B., & Johnson, A. (2012) · Cited by 34
You Are Your Photographs: Detecting Multiple Identities of Vendors in the Darknet Marketplaces
Wang, X., Peng, P., Wang, C., & Wang, G. (2018) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3196494.3196529 · Cited by 46
“Tor (short for łThe Onion Routerž) is the most widely used tool for anonymous communications on the Internet [12].”
BackgroundMethodDynaFlow: An Efficient Website Fingerprinting Defense Based on Dynamically-Adjusting Flows
Lu, D., Bhat, S., Kwon, A., & Devadas, S. (2018) · Workshop on Privacy in the Electronic Society · doi:10.1145/3267323.3268960 · Cited by 44
“Due to increases in mass surveillance and other attacks on privacy, many Internet users have turned to Tor [8] to protect their anonymity.”
BackgroundPrivICN: Privacy-preserving content retrieval in information-centric networking
Bernardini, C., Marchal, S., Asghar, M. R., & Crispo, B. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.11.012 · Cited by 40
Anonymous Communication via Anonymous Identity‐Based Encryption and Its Application in IoT
Jiang, L., Li, T., Li, X., Atiquzzaman, M., Ahmad, H., & Wang, X. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/6809796 · Cited by 36
Improving End-to-End Availability Using Overlay Networks
Andersen, D. G. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.1184/r1/6606386 · Cited by 34
Gopal, D. G., & Heninger, N. (2012) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2381966.2381972 · Cited by 33
“Torchestra: Reducing Interactive Traf.c Delays over Tor Deepika GopalNadia HeningerUC San Diego UC San Diego drgopal@cs.ucsd.edu nadiah@cs.princeton.edu ABSTRACT Tor is an onion routing network that protects users privacy by relaying tra.c through a series of nodes that run Tor software.”
Analysis of location privacy solutions in wireless sensor networks
Rı́os, R., & López, J. (2011) · IET Communications · doi:10.1049/iet-com.2010.0825 · Cited by 33
“This can be achieved by encryption and padding at each hop [11].”
BackgroundCellFlood: Attacking Tor Onion Routers on the Cheap
Barbera, M. V., Kemerlis, V. P., Pappas, V., & Keromytis, A. D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40203-6_37 · Cited by 33
“To date, the Tor network [5], one of the most widely used anonymizing systems, consists of more than 3000 Onion Routers that serve daily over 400000 users [25].”
BackgroundIndividual versus Organizational Computer Security and Privacy Concerns in Journalism
McGregor, S. E., Roesner, F., & Caine, K. E. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0048 · Cited by 34
“, [15, 16]), the technical computer security community has built many secure communications tools over the years, including OTR for encrypted chat [22], PGP for encrypted email [23], Tor for anonymous web browsing [24], and many others [25].”
BackgroundThe potential harms of the Tor anonymity network cluster disproportionately in free countries
Jardine, E., Lindner, A. M., & Owenson, G. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2011893117 · Cited by 33
Website Fingerprinting in the Age of QUIC
Smith, J.-P., Mittal, P., & Perrig, A. (2021) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2021-0017 · Cited by 45
“Privacyenhancing technologies, such as Tor [1] and VPNs, allow users to browse the web in relative privacy by hiding communication meta-data, such as destination IP ad-”
BackgroundSpy vs. Spy: Rumor Source Obfuscation
Fanti, G. C., Kairouz, P., Oh, S., & Viswanath, P. (2015) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2796314.2745866 · Cited by 47
MQTT-A: A Broker-Bridging P2P Architecture to Achieve Anonymity in MQTT
Buccafurri, F., Angelis, V. D., & Lazzaro, S. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3264019 · Cited by 38
Onions Based on Universal Re-encryption – Anonymous Communication Immune Against Repetitive Attack
Gomułkiewicz, M., Klonowski, M., & Kutyłowski, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31815-6_32 · Cited by 33
Defense against misbehavior in anonymous vehicular ad hoc networks
Sun, J., & Fang, Y. M. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.04.013 · Cited by 33
Arp, D., Yamaguchi, F., & Rieck, K. (2015) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2714576.2714627 · Cited by 33
Cangialosi, F., Levin, D., & Spring, N. T. (2015) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2815675.2815701 · Cited by 33
TIME: An Open Platform for Capturing, Processing and Delivering Transport-Related Data
Bacon, J., Beresford, A. R., Evans, D., Ingram, D., Trigoni, N., Guitton, A., & Skordylis, A. (2008) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc08.2007.158 · Cited by 33
Wifi-Reports: Improving Wireless Network Selection with Collaboration
Pang, J., Greenstein, B., Kaminsky, M., McCoy, D., & Seshan, S. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.151 · Cited by 33
More Anonymous Onion Routing Through Trust
Johnson, A., & Syverson, P. F. (2009) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2009.27 · Cited by 33
“Onion routing is a type of anonymous communication that creates cryptographic circuits along an unpredictable route through a network of nodes called onion routers and passes traffic bidirectionally along those circuits with minimal latency [1], [2], [ 3 ].”
BackgroundSelf-citationCatalano, D., Fiore, D., & Gennaro, R. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653682 · Cited by 33
“Perhaps the most famous of such solutions is the socalled Onion Routing Project, recently replaced by Tor [15] (the second generation onion router).”
BackgroundMethodOn Secure and Anonymous Buyer-Seller Watermarking Protocol
Deng, M., & Preneel, B. (2008) · International Conference on Internet and Web Applications and Services · doi:10.1109/iciw.2008.28 · Cited by 33
Path Selection Metrics for Performance-Improved Onion Routing
Panchenko, A., & Renner, J. (2009) · IEEE/IPSJ International Symposium on Applications and the Internet (SAINT) · doi:10.1109/saint.2009.26 · Cited by 33
Security and Privacy Analysis of National Science Foundation Future Internet Architectures
Ambrosin, M., Compagno, A., Conti, M., Ghali, C., & Tsudik, G. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2798280 · Cited by 33
Beaver: A Decentralized Anonymous Marketplace with Secure Reputation.Preprint
Soska, K., Kwon, A., Christin, N., & Devadas, S. (2016) · IACR Cryptology ePrint Archive · Cited by 61
Chao, D., Xu, D., Gao, F., Zhang, C., Zhang, W., & Zhu, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3350006 · Cited by 43
Real-Time Website Fingerprinting Defense via Traffic Cluster Anonymization
Shen, M., Ji, K., Wu, J., Li, Q., Kong, X., Xu, K., & Zhu, L. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00247 · Cited by 51
“The Onion Router (Tor) is one of the popular anonymous communication services [1], which enables millions of users to access the Internet without revealing their identities.”
BackgroundA Censorship-Resistant, Privacy-Enhancing and Fully Decentralized Name System
Wachs, M., Schanzenbach, M., & Grothoff, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12280-9_9 · Cited by 40
XPay: practical anonymous payments for tor routing and other networked services
Chen, Y., Sion, R., & Cărbunar, B. (2009) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1655188.1655195 · Cited by 41
van Hardeveld, G. J., Webber, C., & O’Hara, K. (2017) · American Behavioral Scientist · doi:10.1177/0002764217734271 · Cited by 36
An Architecture for Accountable Anonymous Access in the Internet-of-Things Network
Ma, Y., Wu, Y., Ge, J., & Li, J. (2018) · IEEE Access · doi:10.1109/access.2018.2806483 · Cited by 32
Ma, Y., Wu, Y., Li, J., & Ge, J. (2019) · Information Sciences · doi:10.1016/j.ins.2019.01.054 · Cited by 32
On the Importance of Encrypted-SNI ({ESNI}) to Censorship Circumvention
Chai, Z., Ghafari, A., & Houmansadr, A. (2019) · USENIX Security Symposium · Cited by 62
A Modern View on Forward Security
Boyd, C., & Gellert, K. (2020) · The Computer Journal · doi:10.1093/comjnl/bxaa104 · Cited by 42
Knowing your Bitcoin Customer: Money Laundering in the Bitcoin Economy
Crawford, J. B., & Guan, Y. (2020) · International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE) · doi:10.1109/sadfe51007.2020.00013 · Cited by 44
“The function of Tor hidden services is to provide anonymity of the provider of the service, and so offering a hidden service alongside a “clearnet” or public internet website negates this security [10].”
BackgroundUCoin: An Efficient Privacy Preserving Scheme for Cryptocurrencies
Nosouhi, M. R., Yu, S., Sood, K., Grobler, M., Jurdak, R., Dorri, A., & Shen, S. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3130952 · Cited by 32
“In other solutions for anonymous communication (e.g., Tor [24] and onion routing [25]), a number of trusted mixing servers are needed, otherwise, the protocols become vulnerable against traffic analysis attacks [16].”
BackgroundCompromising Anonymity Using Packet Spinning
Pappas, V., Athanasopoulos, E., Ioannidis, S., & Markatos, E. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85886-7_11 · Cited by 32
Mangili, M., Martignon, F., & Paraboschi, S. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.11.010 · Cited by 32
“In order to mitigate this issue, DiBenedetto et al. in [29] propose ANDaNA, an adaptation of onion-routing [30] specifically tailored for NDN.”
BackgroundLiu, V., Han, S., Krishnamurthy, A., & Anderson, T. E. (2011) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/2070562.2070576 · Cited by 32
Protocol-level attacks against Tor
Ling, Z., Luo, J., Yu, W., Fu, X., Weijia Jia, B., & Zhao, W. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.11.005 · Cited by 33
On performance bottleneck of anonymous communication networks
Pries, R., Yu, W., Graham, S., & Fu, X. (2008) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2008.4536239 · Cited by 32
SmartWalk: Enhancing Social Network Security via Adaptive Random Walks
Liu, Y., Ji, S., & Mittal, P. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978319 · Cited by 40
“…leverage the trust relationships in social networks to improve their system security and privacy, such as Sybil defenses [51, 52, 35, 24, 13, 44, 43], anonymous communication [37, 34, 12, 15], secure routing [31, 24, 32], censorship resilience [41, 1, 2] and secure reputation systems [44, 17].”
BackgroundMethodInferring Application Type Information from Tor Encrypted Traffic
He, G., Yang, M., Luo, J., & Gu, X. (2014) · International Conference on Advanced Cloud and Big Data · doi:10.1109/cbd.2014.37 · Cited by 31
Improved Conditional E-Payments
Blanton, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-68914-0_12 · Cited by 31
CPV: Delay-Based Location Verification for the Internet
Abdou, A., Matrawy, A., & van Oorschot, P. C. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2451614 · Cited by 31
PeerFlow: Secure Load Balancing in Tor
Johnson, A., Jansen, R., Hopper, N., Segal, A., & Syverson, P. F. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0017 · Cited by 31
“Tor [12] is a popular anonymous-communication network.”
Self-citationAnalysis of Fingerprinting Techniques for Tor Hidden Services
Panchenko, A., Mitseva, A., Henze, M., Lanze, F., Wehrle, K., & Engel, T. (2017) · doi:10.1145/3139550.3139564 · Cited by 40
“Tor is the most popular low-latency anony-mization network that aims to hide the user’s IP address while communicating on the Internet [13].”
BackgroundMethodDropping on the Edge: Flexibility and Traffic Confirmation in Onion Routing Protocols
Rochet, F., & Pereira, O. (2018) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2018-0011 · Cited by 31
Hamlin, A., Ostrovsky, R., Weiss, M., & Wichs, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17656-3_9 · Cited by 31
Breaking and (Partially) Fixing Provably Secure Onion Routing
Kuhn, C., Beck, M., & Strufe, T. (2020) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40000.2020.00039 · Cited by 31
“We start this section by describing our attack, then explain how the oracles have been modified and how the correct use of oracles detects the attack.”
BackgroundRobust Revocable Anonymous Authentication for Vehicle to Grid Communications
Kilari, V. T., Yu, R., Misra, S., & Xue, G. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2948803 · Cited by 33
“All communications are carried over anonymous channels such as Tor [12], which prevents traffic analysis attacks.”
BackgroundHang With Your Buddies to Resist Intersection Attacks
Wolinsky, D. I., Syta, E., & Ford, B. (2013) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 33
XAI-Based Microarchitectural Side-Channel Analysis for Website Fingerprinting Attacks and Defenses
Gülmezoğlu, B. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3117145 · Cited by 40
“For this reason, Tor network [2] has been designed to conceal the identity of the users by encryption in the application layer of the communication protocol stack, in which the user identity is not revealed to network observers.”
MethodFew-shot Website Fingerprinting attack with Meta-Bias Learning
Chen, M., Wang, Y., & Zhu, X. (2022) · Pattern Recognition · doi:10.1016/j.patcog.2022.108739 · Cited by 35
Systematic Approach for Detection and Assessment of Dark Web Threat Evolution
William, P., Jawale, M. A., Pawar, A. B., Bibave, R. R., & Narode, P. (2022) · Advances in digital crime, forensics, and cyber terrorism book series · doi:10.4018/978-1-6684-6444-1.ch013 · Cited by 32
An Anonymity Vulnerability in Tor
Tan, Q., Wang, X., Shi, W., Tang, J., & Tian, Z. (2022) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2022.3174003 · Cited by 31
Marionette: a programmable network-traffic obfuscation system
Dyer, K. P., Coull, S. E., & Shrimpton, T. (2015) · USENIX Security Symposium · Cited by 31
A mechanism to enforce privacy in vehicle-to-infrastructure communication
Cencioni, P., & Pietro, R. D. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.12.009 · Cited by 31
A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
Sun, J., Zhang, C., & Fang, Y. M. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2007.230 · Cited by 31
Human-in-the-Loop Mobile Networks: A Survey of Recent Advancements
Duan, L., Huang, L., Langbort, C., Pozdnukhov, A., Walrand, J. C., & Li, Z. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2695738 · Cited by 33
Tor anonymous traffic identification based on gravitational clustering
Rao, Z., Niu, W., Zhang, X., & Li, H. (2017) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-017-0566-4 · Cited by 33
Proof-of-Work as Anonymous Micropayment: Rewarding a Tor Relay
Biryukov, A., & Pustogarov, I. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47854-7_27 · Cited by 31
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.