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 901–1,000 of 1,001
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
Reliable Recon in Adversarial Peer-to-Peer Botnets
Andriesse, D., Rossow, C., & Bos, H. (2015) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2815675.2815682 · Cited by 26
“Furthermore, the bandwidth and latency performance of the Tor network is known to be constrained, resulting in slowly converging, and thus inaccurate, crawling results [8, 26].”
BackgroundMethodSecure Encounter-Based Mobile Social Networks: Requirements, Designs, and Tradeoffs
Mohaien, A., Kune, D. F., Vasserman, E. Y., Kim, M., & Kim, Y. (2013) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2013.19 · Cited by 26
Obfuscating the Topical Intention in Enterprise Text Search
Pang, H., Xiao, X., & Shen, J. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.43 · Cited by 26
“In particular, anonymization schemes like Tor [2] are not applicable when access to the database requires a subscription or user authentication.”
BackgroundCyber Crime Scene Investigations (C²SI) through Cloud Computing
Fu, X., Ling, Z., Yu, W., & Luo, J. (2010) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2010.33 · Cited by 26
Wireless sensor network: Security challenges
Blilat, A., Bouayad, A., Chaoui, N. E. H., & Ghazi, M. E. (2012) · National Days of Network Security and Systems · doi:10.1109/jns2.2012.6249244 · Cited by 26
On the Secrecy of Spread-Spectrum Flow Watermarks
Luo, X., Zhang, J., Perdisci, R., & Lee, W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15497-3_15 · Cited by 26
Toward anonymity in Delay Tolerant Networks: Threshold Pivot Scheme
Jansen, R., & Beverly, R. (2010) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2010.5680442 · Cited by 26
Zerocash: Decentralized Anonymous Payments from Bitcoin (extended version)
Ben‐Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · Cited by 27
One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries.
Henry, R., Huang, Y., & Goldberg, I. (2013) · Cited by 26
lib•erate, (n): a library for exposing (traffic-classification) rules and avoiding them efficiently
Li, F., Razaghpanah, A., Kakhki, A. M., Niaki, A. A., Choffnes, D., Gill, P., & Mislove, A. E. (2017) · ACM Internet Measurement Conference (IMC) · doi:10.1145/3131365.3131376 · Cited by 27
“However, there is an active arms race between providers of proxies like Tor and censors who attempt to detect and block them.”
BackgroundInfluentialCYCLOSA: Decentralizing Private Web Search through SGX-Based Browser Extensions
Pires, R. P., Goltzsche, D., Mokhtar, S. B., Bouchenak, S., Boutet, A., Felber, P. A., Kapitza, R., Pasin, M., & Schiavoni, V. (2018) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2018.00053 · Cited by 36
“We compare C YCLOSA against five state-of-the-art private Web search approaches ( e.g T OR [3], T RACK M E N OT [8], G OO PIR [9], PEAS [10], X-S EARCH [11]), and a protection-free Web search scenario.”
BackgroundMethodAP-Attack: A Novel User Re-identification Attack On Mobility Datasets
Maouche, M., Mokhtar, S. B., & Bouchenak, S. (2017) · EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous) · doi:10.1145/3144457.3144494 · Cited by 26
“This experiment shows that sending mobility data "anony-mously" (e.g., by using anonymous communication protocols such as TOR [10]) to application providers is not sufficient to protect the privacy of users as an adversary using re-identification attacks is able to recognize from 45% to 79% of the users in the four da…”
Linkable Group Signature for Auditing Anonymous Communication
Zheng, H., Wu, Q., Qin, B., Zhong, L., He, S., & Liu, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93638-3_18 · Cited by 26
Can Cryptocurrencies Preserve Privacy and Comply With Regulations?
Goodell, G., & Aste, T. (2019) · Frontiers in Blockchain · doi:10.3389/fbloc.2019.00004 · Cited by 26
Probabilistic analysis of onion routing in a black-box model
Feigenbaum, J., Johnson, A., & Syverson, P. F. (2007) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1314333.1314335 · Cited by 29
Self-citationTime-Series Pattern Based Effective Noise Generation for Privacy Protection on Cloud
Zhang, G., Liu, X., & Yang, Y. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2298013 · Cited by 28
SWEET: Serving the Web by Exploiting Email TunnelsPreprint
Houmansadr, A., Zhou, W., Caesar, M., & Borisov, N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.3191 · Cited by 26
“As a result, repressive regimes extensively monitor their citizens’ access to the Internet and restrict open access to public networks [38] by using different technologies, ranging from simple IP address blocking (e.g., through access control lists) and DNS hijacking to more complicated and…”
BackgroundOptimal tag suppression for privacy protection in the semantic Web
Parra‐Arnau, J., Rebollo‐Monedero, D., Forné, J., Muñoz, J. L., & Esparza, Ó. (2012) · Data & Knowledge Engineering · doi:10.1016/j.datak.2012.07.004 · Cited by 26
Detection and analysis of eavesdropping in anonymous communication networks
Chakravarty, S., Portokalidis, G., Polychronakis, M., & Keromytis, A. D. (2014) · International Journal of Information Security · doi:10.1007/s10207-014-0256-7 · Cited by 25
Who Searches the Searchers? Community Privacy in the Age of Monolithic Search Engines
Poritz, J. A. (2007) · The Information Society · doi:10.1080/01972240701572921 · Cited by 25
AC3N: Anonymous communication in Content-Centric Networking
Tsudik, G., Uzun, E., & Wood, C. A. (2016) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc.2016.7444924 · Cited by 25
Honey Onions: A framework for characterizing and identifying misbehaving Tor HSDirs
Sanatinia, A., & Noubir, G. (2016) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2016.7860478 · Cited by 25
“Tor [10] is an anonymity network that allows users to circumvent censorship and protect their privacy, activities and location from government agencies and corporations.”
BackgroundDAPA: A Decentralized, Accountable, and Privacy-Preserving Architecture for Car Sharing Services
Huang, C., Lu, R., Ni, J., & Shen, X. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2980777 · Cited by 26
“All communications with T are not anonymous, i.e., T knows the identity of the entity who communicates with it, while the communication between honest entities is not observed by A , which can be achieved by the anonymous network, e.g., Tor network [27].”
BackgroundXenakis, D., Tsiota, A., Koulis, C.-T., Xenakis, C., & Passas, N. I. (2021) · IEEE Access · doi:10.1109/access.2021.3079625 · Cited by 25
Tor Hidden Services: A Systematic Literature Review
Trujillo, D. L. H., & Ruiz‐Martínez, A. (2021) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp1030025 · Cited by 28
Secure and Lightweight Authentication for Mobile-Edge Computing-Enabled WBANs
Yang, X., Yi, X., Khalil, I., Luo, J., Bertino, E., Nepal, ., & Huang, X. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3138989 · Cited by 25
“Once registered, they can get access to each other via an anonymous channel implemented with anonymous programs such as Tor [31].”
WFDefProxy: Real World Implementation and Evaluation of Website Fingerprinting Defenses
Gong, J., Zhang, W., Zhang, C., & Wang, T. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3327662 · Cited by 37
“A S PEOPLE’S awareness of the threat of tracking and surveillance grows, Tor [9], the onion-routing anonymity network, has become a popular tool to protect user privacy on the Internet.”
BackgroundTor HTTP Usage and Information Leakage
Huber, M., Mulazzani, M., & Weippl, E. R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13241-4_22 · Cited by 25
“The Tor network [1] is a widely deployed anonymization network which hides the user’s IP address on the Internet.”
BackgroundKohno, T., & Johnson, B. D. (2011) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/1953163.1953173 · Cited by 27
Pseudonymous Smart Metering without a Trusted Third Party
Finster, S., & Baumgart, I. (2013) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2013.234 · Cited by 25
Long PN code based DSSS watermarking
Huang, J., Pan, X., Fu, X., & Wang, J. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935064 · Cited by 25
Optimal Forgery and Suppression of Ratings for Privacy Enhancement in Recommendation Systems
Parra-Arnau, J., Rebollo‐Monedero, D., & Forné, J. (2014) · Entropy · doi:10.3390/e16031586 · Cited by 26
“entity, which is thereafter responsible for the protection of their data. In the literature, numerous attempts to protect privacy have followed the traditional method of anonymous communications [27]–[30], which is fundamentally based on the suppositions of soft privacy. Unfortunately, anonymous-communication systems…”
BackgroundTowards Plugging Privacy Leaks in the Domain Name System
Lu, Y., & Tsudik, G. (2010) · IEEE International Conference on Peer-to-Peer Computing (P2P) · doi:10.1109/p2p.2010.5569976 · Cited by 25
Geddes, J., Jansen, R., & Hopper, N. (2014) · Workshop on Privacy in the Electronic Society · doi:10.1145/2665943.2665948 · Cited by 25
“The Tor network [7] has been very succesful in attracting users, servicing millions of clients daily.”
BackgroundmTor: A multipath Tor routing beyond bandwidth throttling
Yang, L., & Li, F. (2015) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2015.7346860 · Cited by 25
Traffic Flow Confidentiality in IPsec: Protocol and Implementation
Király, C., Teofili, S., Bianchi, G., Cigno, R. L., Nardelli, M., & Delzeri, E. (2008) · Springer eBooks · doi:10.1007/978-0-387-79026-8_22 · Cited by 25
The Economics of Mass Surveillance and the Questionable Value of Anonymous Communications.
Danezis, G., & Wittneben, B. B. F. (2006) · Cited by 25
What's the deal with privacy apps? a comprehensive exploration of user perception and usability
Assal, H., Hurtado, S., Imran, A., & Chiasson, S. (2015) · International Conference on Mobile and Ubiquitous Multimedia (MUM) · doi:10.1145/2836041.2836044 · Cited by 39
“Accordingly, in order to attract more users, ensure their successful participation in the network, and improve privacy, the usability of Tor tools is considered “ a security requirement " [19].”
BackgroundMethodInfluentialPrivacy Challenges in the Quantified Self Movement – An EU Perspective
Leibenger, D., Möllers, F., Petrlic, A., Petrlic, R., & Sorge, C. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0042 · Cited by 35
“Concerning communication, unlinkability of different interactions between users and service providers is offered by anonymity networks like Tor [10].”
BackgroundAnalysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
Chothia, T. (2006) · Lecture notes in computer science · doi:10.1007/11888116_9 · Cited by 25
Towards Effective and Efficient Padding Machines for TorPreprint
Pulls, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.13471 · Cited by 34
“Tor [4] recently integrated a circuit padding framework for circuit-level defenses in the form of padding machines 1 .”
BackgroundGentile, A. F., Macrì, D., Carnì, D. L., Greco, E., & Lamonaca, F. (2024) · Applied Sciences · doi:10.3390/app14188501 · Cited by 31
“Our experimental results capture several key features of Dark Net communications, including increased latency due to multiple relay hops, bandwidth limitations from encryption and routing overhead, and the impact of network instability characteristic of TOR circuits.”
Perlman, R., Kaufman, C., & Perlner, R. A. (2010) · Identity and Trust on the Internet · doi:10.1145/1750389.1750399 · Cited by 24
Benchmarking two techniques for Tor classification: Flow level and circuit level classification
Shahbar, K., & Zincir-Heywood, N. (2014) · IEEE Symposium on Computational Intelligence in Cyber Security (CICS) · doi:10.1109/cicybs.2014.7013368 · Cited by 30
To catch a fake: Curbing deceptive Yelp ratings and venues
Rahman, M., Cărbunar, B., Ballesteros, J., & Chau, D. H. (2015) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11264 · Cited by 31
Secure Internet Voting on Limited Devices with Anonymized DSA Public Keys
Haenni, R., & Spycher, O. (2011) · ARBOR - Bern University of Applied Sciences Repository · doi:10.24451/arbor.8289 · Cited by 24
Skowyra, R., Bauer, K. S., Dedhia, V., & Okhravi, H. (2016) · ACM Workshop on Moving Target Defense (MTD) · doi:10.1145/2995272.2995276 · Cited by 24
“PHEAR’s threat model is similar to that of Tor [15]: the adversary may monitor some fraction of network traffic, and can modify, replay, reroute, drop, delay, or inject packets in-flight.”
BackgroundMethodisAnon: Flow-Based Anonymity Network Traffic Identification Using Extreme Gradient Boosting
Cai, Z., Jiang, B., Lü, Z., Liu, J., & Ma, P. (2019) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2019.8851964 · Cited by 27
Acceleration of Intrusion Detection in Encrypted Network Traffic Using Heterogeneous Hardware
Papadogiannaki, E., & Ioannidis, S. (2021) · Sensors · doi:10.3390/s21041140 · Cited by 25
Context-aware Website Fingerprinting over Encrypted Proxies
Ma, X., Shi, M., An, B., Li, J., Luo, D. X., Zhang, J., & Guan, X. (2021) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom42981.2021.9488676 · Cited by 30
Order-C Secure Multiparty Computation for Highly Repetitive Circuits
Beck, G., Goel, A., Jain, A., & Kaptchuk, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77886-6_23 · Cited by 24
“Indeed, the honest majority of resources assumptions (a different but closely related set of assumptions) in Bitcoin [Nak08] and TOR [RSG98,DMS04] appear to hold up in practice when there are many protocol participants.”
BackgroundWei, W., An, B., Qiao, K., & Shen, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3310105 · Cited by 25
“Finally, we assume that all the communication channels in our system is secured via security protocols (e.g., SSL/TLS tunnels, Tor [13]).”
MethodBirkett, J., & Stebila, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14081-5_18 · Cited by 24
Design principles for low latency anonymous network systems secure against timing attacks
Wiangsripanawan, R., Susilo, W., & Safavi–Naini, R. (2007) · Cited by 24
Beitollahi, H., & Deconinck, G. (2011) · International Journal of Critical Infrastructure Protection · doi:10.1016/j.ijcip.2011.06.003 · Cited by 24
Arief, B., Coopamootoo, K., Emms, M., & van Moorsel, A. (2014) · Workshop on Privacy in the Electronic Society · doi:10.1145/2665943.2665965 · Cited by 24
“Many serve the purpose of anonymising communication such as Onion Routing [16], Hordes [17], Crowds [18], Anonymiser [19], Tor [20] and authentication protocols for mobile scenarios [21].”
Traffic Identification of Tor and Web-Mix
Bai, X., Zhang, Y., & Niu, X. (2008) · International Conference on Intelligent Systems Design and Applications (ISDA) · doi:10.1109/isda.2008.209 · Cited by 24
Routing in the Dark: Pitch Black
Evans, N. S., GauthierDickey, C., & Grothoff, C. (2007) · Annual Computer Security Applications Conference · doi:10.1109/acsac.2007.4412998 · Cited by 24
Survey on Anonymity in Unstructured Peer-to-Peer Systems
Xiao, R. (2008) · Journal of Computer Science and Technology · doi:10.1007/s11390-008-9162-7 · Cited by 24
Constructing plausible innocuous pseudo queries to protect user query intention
Wu, Z., Shi, J., Lu, C., Chen, E., Xu, G., Li, G., Xie, S., & Yu, P. S. (2015) · Information Sciences · doi:10.1016/j.ins.2015.07.010 · Cited by 24
BitStalker: Accurately and efficiently monitoring bittorrent traffic
Bauer, K. S., McCoy, D., Grunwald, D. C., & Sicker, D. (2009) · IEEE International Workshop on Information Forensics and Security · doi:10.1109/wifs.2009.5386457 · Cited by 24
Optimization Based Clustering Algorithms for Authorship Analysis of Phishing Emails
Seifollahi, S., Bagirov, A., Layton, R., & Gondal, I. (2017) · Neural Processing Letters · doi:10.1007/s11063-017-9593-7 · Cited by 24
“Cybercriminals benefit from a large number of anonymization technologies, such as multi-stage attacks, virtual private networks, and Tor [10,15].”
BackgroundHow to End Password Reuse on the Web
Wang, K. C., & Reiter, M. K. (2019) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23360 · Cited by 33
A New Approach to Deanonymization of Unreachable Bitcoin Nodes
Mastan, I. D., & Paul, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-02641-7_13 · Cited by 24
Privacy Protection in Location-Based Services: A Survey
Bettini, C. (2018) · Springer eBooks · doi:10.1007/978-3-319-98161-1_4 · Cited by 24
SPINE: Surveillance protection in the network elements
Datta, T., Feamster, N., Rexford, J., & Wang, L. (2019) · USENIX Security Symposium · Cited by 24
Towards a Collection of Security and Privacy Patterns
Papoutsakis, M., Fysarakis, K., Spanoudakis, G., Ioannidis, S., & Koloutsou, K. (2021) · Applied Sciences · doi:10.3390/app11041396 · Cited by 26
“Other well-known techniques for achieving unlinkability include the use of steganography [79], as well as spread-spectrum [80] and spread-time [81] stegosystems.”
Low-rate DoS attack detection method based on hybrid deep neural networks
Xu, C., Shen, J., & Du, X. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102879 · Cited by 33
Privacy-Preserving Querying in Sensor Networks
Cristofaro, E. D., Ding, X., & Tsudik, G. (2009) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2009.5235352 · Cited by 25
Current and future privacy enhancing technologies for the internet
Deswarte, Y., & Melchor, C. A. (2006) · Annals of Telecommunications · doi:10.1007/bf03219914 · Cited by 24
A Spatiotemporal Model of Strategies and Counter Strategies for Location Privacy Protection
Duckham, M., Kulik, L., & Birtley, A. (2006) · Lecture notes in computer science · doi:10.1007/11863939_4 · Cited by 24
“A 3P may have access to additional information, for example generated by secret surveillance devices or through processing of an agent’s device’s mobile IP address (e.g., [ 3 ]).”
BackgroundAn Analysis Study on Zone-Based Anonymous Communication in Mobile Ad Hoc Networks
Wu, X., & Bertino, E. (2007) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2007.70213 · Cited by 24
How China Is Blocking TorPreprint
Winter, P., & Lindskog, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.0447 · Cited by 24
PRoT-FL: A privacy-preserving and robust Training Manager for Federated Learning
Gamiz, I., Regueiro, C., Jacob, E., Lage, Ó., & Higuero, M. (2024) · Information Processing & Management · doi:10.1016/j.ipm.2024.103929 · Cited by 23
Kaloper-Meršinjak, D., Mehnert, H., Madhavapeddy, A., & Sewell, P. (2015) · Apollo (University of Cambridge) · doi:10.17863/cam.41243 · Cited by 23
Vanbever, L., Li, O., Rexford, J., & Mittal, P. (2014) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/2670518.2673869 · Cited by 23
“This work focuses on low-latency anonymity systems such as the Tor network [14].”
BackgroundCo-utile Collaborative Anonymization of Microdata
Soria-Comas, J., & Domingo‐Ferrer, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23240-9_16 · Cited by 23
A Light in the Dark Web: Linking Dark Web Aliases to Real Internet Identities
Arabnezhad, E., Morgia, M. L., Mei, A., Nemmi, E. N., & Stefa, J. (2020) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs47774.2020.00081 · Cited by 29
“Tor [4] is the most popular tool to get anonymity on the Internet.”
BackgroundMycelium: Large-Scale Distributed Graph Queries with Differential Privacy
Roth, E., Newatia, K., Ma, Y., Zhong, K., Angel, S., & Haeberlen, A. (2021) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3477132.3483585 · Cited by 37
“The key idea is a new mix network and a telescoping circuit mechanism inspired by Tor [31] that allows devices to forward their requests via other devices until the requests reach their destinations (§3).”
BackgroundMethodInfluentialDecentralized Identity Authentication with Auditability and Privacy
Alangot, B., Szałachowski, P., Dinh, T. T. A., Meftah, S., Gana, J. I., Aung, K. M. M., & Li, Z. (2022) · Algorithms · doi:10.3390/a16010004 · Cited by 26
“To relax this assumption, the service could use an anonymity network [40] while interacting with the blockchain platform.)”
Classifying Tor Traffic Encrypted Payload Using Machine Learning
Choorod, P., Weir, G. R. S., & Fernando, A. (2024) · IEEE Access · doi:10.1109/access.2024.3356073 · Cited by 26
Privacy and Liveliness for Reputation Systems
Schiffner, S., Clauß, S., & Steinbrecher, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16441-5_14 · Cited by 23
Accountable Anonymous Communication
Díaz, C., & Preneel, B. (2007) · Springer eBooks · doi:10.1007/978-3-540-69861-6_16 · Cited by 24
Anonymity and traceability in cyberspace
Clayton, R. (2005) · doi:10.48456/tr-653 · Cited by 23
A Mutual Anonymous Peer-to-Peer Protocol Design
Han, J., Liu, Y., Xiao, L., Xiao, R., & Ni, L. M.-S. (2005) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2005.49 · Cited by 23
People-Centric Urban Sensing: Security Challenges for the New Paradigm
Johnson, P. C., Kapadia, A. C., Kotz, D. F., & Triandopoulos, N. (2007) · Cited by 23
TOR vs I2P: A comparative study
Ali, A., Khan, M., Saddique, M., Pirzada, U., Zohaib, M., Ahmad, I., & Debnath, N. C. (2016) · IEEE International Conference on Industrial Technology (ICIT) · doi:10.1109/icit.2016.7475027 · Cited by 23
SecureCoin: A Robust Secure and Efficient Protocol for Anonymous Bitcoin Ecosystem
Ibrahim, M. H. (2017) · International journal of network security · doi:10.6633/ijns.201703.19(2).14 · Cited by 34
“The anonymous communication network, ”Tor” [13] is employed in [29] to avoid centralized mixing and to provide unlinkability.”
BackgroundOn Enforcing the Digital Immunity of a Large Humanitarian Organization
Blond, S. L., Cuevas, A., Troncoso-Pastoriza, J. R., Jovanovic, P., Ford, B., & Hubaux, J. (2018) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2018.00019 · Cited by 23
“Existing anonymity network designs typically achieve either strong anonymity or efficiency: For example, the popular Tor anonymity network is relatively efficient but does not defend against an attacker observing ingress and egress traffic [10].”
BackgroundLockmix: a secure and privacy-preserving mix service for Bitcoin anonymity
Bao, Z., Shi, W., Kumari, S., Kong, Z., & Chen, C. (2019) · International Journal of Information Security · doi:10.1007/s10207-019-00459-6 · Cited by 28
“(6) When A knows the information in the public log, she will use A (cid:2) C to unblind {[ k out ] A C } M priv to generate { k out } M priv the information, and then send it through an anonymous network (such as Tor [27]) to the public log by t 3 time.”
Method2ch-TCN: A Website Fingerprinting Attack over Tor Using 2-channel Temporal Convolutional Networks
Wang, M., Li, Y., Wang, X., Liu, T., Shi, J., & Chen, M. (2020) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc50000.2020.9219717 · Cited by 30
Secure and Privacy-Aware Blockchain Design: Requirements, Challenges and Solutions
Aslam, S., Tošić, A., & Mrissa, M. (2021) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp1010009 · Cited by 29
SWEET: Serving the Web by Exploiting Email Tunnels
Houmansadr, A., Zhou, W., Caesar, M., & Borisov, N. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2640238 · Cited by 23
“As a result, repressive regimes extensively monitor their citizens’ access to the Internet and restrict open access to public networks [38] by using different technologies, ranging from simple IP address blocking (e.g., through access control lists) and DNS hijacking to more complicated and…”
BackgroundPreventing Active Timing Attacks in Low-Latency Anonymous Communication
Feigenbaum, J., Johnson, A., & Syverson, P. F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14527-8_10 · Cited by 23
Self-citationA potential HTTP-based application-level attack against Tor
Wang, X., Luo, J., Yang, M., & Ling, Z. (2010) · Future Generation Computer Systems · doi:10.1016/j.future.2010.04.007 · Cited by 23
Contrastive Fingerprinting: A Novel Website Fingerprinting Attack over Few-shot Traces
Xie, Y., Feng, J., Huang, W., Zhang, Y., Sun, X., Chen, X., & Luo, X. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645575 · Cited by 33
Multi-party Private Web Search with Untrusted Partners
Romero-Tris, C., Castellà‐Roca, J., & Viejo, A. (2012) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-31909-9_15 · Cited by 22
“An example of this is the Tor anonymity network which is described in [8].”
Laribus: privacy-preserving detection of fake SSL certificates with a social P2P notary network
Fuchs, K.-P., Herrmann, D., Micheloni, A., & Federrath, H. (2015) · EURASIP Journal on Information Security · doi:10.1186/s13635-014-0018-0 · Cited by 22
Security and Privacy by Declarative Design
Maffei, M., Pecina, K., & Reinert, M. (2013) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2013.13 · Cited by 22
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.