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 801–900 of 1,001
Using Sphinx to Improve Onion Routing Circuit Construction
Kate, A., & Goldberg, I. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14577-3_30 · Cited by 37
“In Tor circuit construction [16], a user performs a DH key agreement [15] with each successive node in her circuit over a secure tunnel formed using the already-agreed session keys.”
BackgroundMethodInfluentialForensic investigation of the dark web on the Tor network: pathway toward the surface web
Jin, P., Kim, N., Lee, S., & Jeong, D. (2023) · International Journal of Information Security · doi:10.1007/s10207-023-00745-4 · Cited by 35
“It supports SOCKS Proxy that facilitates communication between a client and server through a proxy server [13].”
Design and Evaluation of a Privacy-Preserving Architecture for Vehicle-to-Grid Interaction
Stegelmann, M., & Kesdoğan, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29804-2_5 · Cited by 32
RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol
Mokhtar, S. B., Berthou, G., Diarra, A., Quéma, V., & Shoker, A. (2013) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2013.52 · Cited by 30
Systems for anonymous communication
Danezis, G., Díaz, C., & Syverson, P. F. (2009) · Cited by 31
Self-citationAnalysis-preserving protection of user privacy against information leakage of social-network Likes
Buccafurri, F., Fotia, L., Lax, G., & Saraswat, V. (2015) · Information Sciences · doi:10.1016/j.ins.2015.08.046 · Cited by 31
Cryptography for Security and Privacy in Cloud Computing
Raß, S., & Slamanig, D. (2013) · Cited by 36
Scalable verification of probabilistic networks
Smolka, S., Kumar, P., Kahn, D. M., Foster, N., Hsu, J., Kozen, D., & Silva, A. (2019) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3314221.3314639 · Cited by 44
Anonymization Techniques for Protecting Privacy: A Survey
Pawar, A., Ahirrao, S. N., & Churi, P. P. (2018) · IEEE Pune Section International Conference (PuneCon) · doi:10.1109/punecon.2018.8745425 · Cited by 44
Talek: Private Group Messaging with Hidden Access Patterns
Cheng, R., Scott, W., Masserova, E., Zhang, I., Goyal, V., Anderson, T. E., Krishnamurthy, A., & Parno, B. J. (2020) · Annual Computer Security Applications Conference · doi:10.1145/3427228.3427231 · Cited by 41
Measuring dark web marketplaces via Bitcoin transactions: From birth to independence
Hiramoto, N., & Tsuchiya, Y. (2020) · Forensic Science International Digital Investigation · doi:10.1016/j.fsidi.2020.301086 · Cited by 46
Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees
Weidner, M., Kleppmann, M., Hugenroth, D., & Beresford, A. R. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484542 · Cited by 37
Encrypted internet traffic classification using a supervised spiking neural network
Rasteh, A., Delpech, F., Melchor, C. A., Zimmer, R., Shouraki, S. B., & Masquelier, T. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.06.055 · Cited by 34
“Increasing demands to protect privacy have led to the development of meth-ods to encrypt traffic, and of different ways to navigate on the Internet anony-mously, such as The Onion Router (Tor)[5] or Virtual Private Networks (VPN) (see e.g. [24]).”
BackgroundCAUDHT: Decentralized Contact Tracing Using a DHT and Blind Signatures
Brack, S., Reichert, L., & Scheuermann, B. (2020) · Conference on Local Computer Networks · doi:10.1109/lcn48667.2020.9314850 · Cited by 30
“Theoreti-cally, a central database could be accessed using anonymizing proxies like Tor [13] to hide the requesting user’s identity.”
MethodInformation-Theoretic Security in Stochastic Control Systems
Venkitasubramaniam, P., Yao, J., & Pradhan, P. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2466089 · Cited by 34
Automatic Identification of Replicated Criminal Websites Using Combined Clustering
Drew, J. M., & Moore, T. W. (2014) · IEEE Security and Privacy Workshops (SPW) · doi:10.1109/spw.2014.26 · Cited by 35
Hashing it out in public: common failure modes of DHT-based anonymity schemes
Tran, A., Hopper, N., & Kim, Y. (2009) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1655188.1655199 · Cited by 31
“INTRODUCTION Anonymous overlay networks allow arbitrary Internet hosts to communicate while attempting to conceal the correspondence between initiators and responders from the members of the overlay, that is, hiding who communicates with whom.”
PEAS: Private, Efficient and Accurate Web Search
Petit, A., Cerqueus, T., Mokhtar, S. B., Brunie, L., & Kosch, H. (2015) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2015.421 · Cited by 30
Anonymous addresses for efficient and resilient routing in F2F overlays
Roos, S., Beck, M., & Strufe, T. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524553 · Cited by 30
“Yet, the openness of such systems presents a vulnerability in itself, enabling attackers to infiltrate the system with a large number of forged participants, as observed in attacks on the Tor [1] network in 20142.”
BackgroundNavigaTor: Finding Faster Paths to Anonymity
Annessi, R., & Schmiedecker, M. (2016) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2016.26 · Cited by 30
“The most widespread and well researched is Tor [1], a low-latency anonymity system that is loosely based on the onion routing [2] principle.”
BackgroundAnonymous routing in structured peer-to-peer overlays
Borissov, N., & Brewer, E. (2005) · Cited by 29
Prism: Real-Time Privacy Protection Against Temporal Network Traffic Analyzers
Li, W., Zhang, X., Bao, H., Yang, B., Li, Z., Shi, H., & Wang, Q. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3267885 · Cited by 35
“DeepCorr [1] is a state-of-the-art network traffic analyzer that focuses on correlating Tor [49] connections.”
BackgroundA platform for privacy protection of data requesters and data providers in mobile sensing
Krontiris, I., & Dimitriou, T. D. (2015) · Computer Communications · doi:10.1016/j.comcom.2015.02.005 · Cited by 29
Au, M. H., Tsang, P. P., & Kapadia, A. C. (2008) · ACM Transactions on Information and System Security · doi:10.1145/2043628.2043630 · Cited by 29
EphPub: Toward robust Ephemeral Publishing
Castelluccia, C., Cristofaro, E. D., Francillon, A., & Kâafar, M. A. (2011) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2011.6089048 · Cited by 29
Point break: a study of bandwidth denial-of-service attacks against Tor
Jansen, R., Vaidya, T., & Sherr, M. (2019) · USENIX Security Symposium · Cited by 67
The Dark Web and cannabis use in the United States: Evidence from a big data research design
Jardine, E., & Lindner, A. M. (2019) · International Journal of Drug Policy · doi:10.1016/j.drugpo.2019.102627 · Cited by 29
How cryptocurrency is laundered: Case study of Coincheck hacking incident
Tsuchiya, Y., & Hiramoto, N. (2021) · Forensic Science International Reports · doi:10.1016/j.fsir.2021.100241 · Cited by 29
Gupta, A., Gupta, R., Jadav, D., Tanwar, S., Kumar, N., & Shabaz, M. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.04.022 · Cited by 39
Sensor network security: more interesting than you think
Anand, M., Cronin, E., Sherr, M., Blaze, M., Ives, Z. G., & Lee, I. (2006) · ScholarlyCommons (University of Pennsylvania) · Cited by 29
Shi, L., Cărbunar, B., & Sion, R. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77366-5_3 · Cited by 32
Managing Incidents in Smart Grids à la Cloud
Alcaraz, C., Agudo, I., Núñez, D., & López, J. (2011) · IEEE International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2011.79 · Cited by 34
Identifying Cross-origin Resource Status Using Application Cache
Lee, S., Kim, H., & Kim, J. K. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23027 · Cited by 30
The TOR data communication system
Haraty, R. A., & Zantout, B. (2014) · Journal of Communications and Networks · doi:10.1109/jcn.2014.000071 · Cited by 29
LASTor: A Low-Latency AS-Aware Tor Client
Akhoondi, M., Yu, C., & Madhyastha, H. V. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2291242 · Cited by 29
A novel application classification attack against Tor
He, G., Yang, M., Luo, J., & Gu, X. (2015) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.3593 · Cited by 29
“Tor is a popular low-latency anonymous communication system that supports TCP applications via an overlay network [1].”
BackgroundMethodIdentifying Proxy Nodes in a Tor Anonymization Circuit
Chakravarty, S., Stavrou, A., & Keromytis, A. D. (2008) · International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) · doi:10.1109/sitis.2008.93 · Cited by 29
Novel Anti-forensics Approaches for Smart Phones
Azadegan, S., Yu, W., Liu, H., Sistani, M. A., & Acharya, S. (2012) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2012.452 · Cited by 29
“…can be anonymized via encryption and use of intermediaries to protect the content and communication relationship such as Anonymizer and Tor [27, 28], watermarking, steganography and covert channels are the information hiding techniques which can encompasses applications, such as copyright…”
MethodEnabling Anonymous Authorization and Rewarding in the Smart Grid
Dimitriou, T. D., & Karame, G. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2496211 · Cited by 32
“One such mechanism, as we mentioned in Section 2, is the anonymity network TOR [22].”
BackgroundA privacy-enhanced OAuth 2.0 based protocol for Smart City mobile applications
Sucasas, V., Μαντάς, Γ., Althunibat, S., Oliveira, L. B., Antonopoulos, A., Otung, I. E., & Rodríguez, J. (2018) · Computers & Security · doi:10.1016/j.cose.2018.01.014 · Cited by 31
Fingerprinting encrypted network traffic types using machine learning
Leroux, S., Bohez, S., Maenhaut, P., Meheus, N., Simoens, P., & Dhoedt, B. (2018) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2018.8406218 · Cited by 32
Adversarial Matching of Dark Net Market Vendor Accounts
Tai, X. H., Soska, K., & Christin, N. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330763 · Cited by 36
Low Latency Anonymous Communication – How Long Are Users Willing to Wait?
Köpsell, S. (2006) · Lecture notes in computer science · doi:10.1007/11766155_16 · Cited by 30
Privacy Preserving Communication in MANETs
Choi, H., McDaniel, P. D., & Porta, T. L. (2007) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2007.4292835 · Cited by 29
Compromising Tor Anonymity Exploiting P2P Information LeakagePreprint
Manils, P., Abdelberri, C., Blond, S. L., Kâafar, M. A., Castelluccia, C., Legout, A., & Dabbous, W. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.1461 · Cited by 29
“However, this required multiple public key operation for every request, and also presented a threat to anonymity from building so many circuits [6].”
The .onion Special-Use Domain Name
Appelbaum, J., & Muffett, A. (2015) · doi:10.17487/rfc7686 · Cited by 29
OnionBots: Subverting Privacy Infrastructure for Cyber Attacks
Sanatinia, A., & Noubir, G. (2015) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2015.40 · Cited by 28
“Tor [38] is the most widely used distributed low-latency anonymity-network.”
BackgroundProbable cause: the deanonymizing effects of approximate DRAM
Rahmati, A., Hicks, M., Holcomb, D. E., & Fu, K. E. (2015) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2749469.2750419 · Cited by 38
Private Buddy Search: Enabling Private Spatial Queries in Social Networks
Khoshgozaran, A., & Shahabi, C. (2009) · doi:10.1109/cse.2009.337 · Cited by 28
Anonymity, information, and machine-assisted proof
Coble, A. R. (2010) · CL Technical Reports · doi:10.48456/tr-785 · Cited by 34
Application of Deep Recurrent Neural Networks for Prediction of User Behavior in Tor Networks
Ishitaki, T., Obukata, R., Oda, T., & Barolli, L. (2017) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/waina.2017.63 · Cited by 30
X-search: revisiting private web search using intel SGX
Mokhtar, S. B., Boutet, A., Felber, P. A., Pasin, M., Pires, R., & Schiavoni, V. (2017) · International Middleware Conference · doi:10.1145/3135974.3135987 · Cited by 31
“The most popular protocol among these solutions is Tor [10],”
BackgroundMethodInfluentialRevisiting User Privacy for Certificate Transparency
Kales, D., Omolola, O., & Ramacher, S. (2019) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2019.00039 · Cited by 36
“Tor [DMS04] and AN.”
A target-centric intelligence approach to WannaCry 2.0
Turner, A., McCombie, S. J., & Uhlmann, A. J. (2019) · Journal of Money Laundering Control · doi:10.1108/jmlc-01-2019-0005 · Cited by 28
Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks
Tang, W., Wang, W., Fanti, G., & Oh, S. (2020) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/3393691.3394213 · Cited by 28
Securing internet applications from routing attacks
Sun, Y., Apostolaki, M., Birge-Lee, H., Vanbever, L., Rexford, J., Chiang, M., & Mittal, P. (2021) · Communications of the ACM · doi:10.1145/3429775 · Cited by 28
ARDEN: Anonymous networking in delay tolerant networks
Shi, C., Luo, X., Traynor, P., Ammar, M., & Zegura, E. W. (2011) · Ad Hoc Networks · doi:10.1016/j.adhoc.2011.11.008 · Cited by 28
Blind Detection of Spread Spectrum Flow Watermarks
Weijia Jia, B., Tso, F. P., Ling, Z., Fu, X., Xuan, D., & Yu, W. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062144 · Cited by 28
Unifying Lightweight Blockchain Client Implementations
Gruber, D., Li, W., & Karame, G. (2018) · doi:10.14722/diss.2018.23010 · Cited by 32
Decentralized Release of Self-Emerging Data using Smart Contracts
Li, C., & Palanisamy, B. (2018) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2018.00033 · Cited by 30
“The proposed protocol enables such a routing scheme through onion routing [20] that requires the sender to first encrypt the secret key using the public key of the recipient and then iteratively form layers of encryption using the public keys of the selected peers on the routing path.”
MethodConcretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
Hazay, C., Orsini, E., Schöll, P., & Soria-Vázquez, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03332-3_4 · Cited by 29
“Nowadays and due to privacy risks, the statistics collected over Tor are generally poor: There is a reduced list of computed functions and only a minority of the relays provide data, which has to be obfuscated before publishing [DMS04].”
BackgroundDark Web in the Dark: Investigating when Transactions Take Place on Cryptomarkets
Tsuchiya, Y., & Hiramoto, N. (2020) · Forensic Science International Digital Investigation · doi:10.1016/j.fsidi.2020.301093 · Cited by 41
“The second technology is the Tor network, in which users ’ messages are routed through a series of relays that serve as a buffer between the users and the websites that they visit (Dingledine et al., 2004).”
BackgroundPrivacy-Preserving DNS: Analysis of Broadcast, Range Queries and Mix-Based Protection Methods
Federrath, H., Fuchs, K.-P., Herrmann, D., & Piosecny, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23822-2_36 · Cited by 36
Passive-Logging Attacks Against Anonymous Communications Systems
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1330332.1330335 · Cited by 30
Antonatos, S., Anagnostakis, K. G., & Markatos, E. P. (2007) · Workshop on Rapid Malcode · doi:10.1145/1314389.1314398 · Cited by 28
Civitas: A Secure Voting System
Clarkson, M. R., Chong, S., & Myers, A. C. (2007) · eCommons (Cornell University) · Cited by 27
ShenTu, Q., & Yu, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.05833 · Cited by 32
“and the bank, and also controls the bank. However, the attacker aims at deanonymizing users rather than interrupting the normal process of coin-mixing. 3.3. Blind-Mixing Blind-Mixing runs on the TOR [21] anonymity network to encrypt communication data between the user and the bank, and to hide the real IP addresses em…”
BackgroundInfluentialHORNET: High-speed Onion Routing at the Network LayerPreprint
Chen, C., Asoni, D. E., Barrera, D., Danezis, G., & Perrig, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.05724 · Cited by 33
“While these systems are generally intended as overlays, some proposals [14, 15] are closer to the network layer in that they use UDP (instead of TCP [23]) between pairs of onion routers.”
BackgroundMethodInfluentialMinimaLT: minimal-latency networking through better security
Petullo, W. M., Zhang, X., Solworth, J. A., Bernstein, D. J., & Lange, T. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516737 · Cited by 32
“We do not address the linking of flows associated with the same IP address, as this type of protection is better afforded by techniques such as onion routing [16].”
BackgroundSteganographic Communication via Spread Optical Noise: A Link-Level Eavesdropping Resilient System
Ma, P. Y., Wu, B., Shastri, B. J., Tait, A. N., Mittal, P., & Prucnal, P. R. (2018) · Journal of Lightwave Technology · doi:10.1109/jlt.2018.2872422 · Cited by 27
Klivan, S., Höltervennhoff, S., Huaman, N., Krause, A., Simko, L., Acar, Y., & Fahl, S. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623180 · Cited by 48
“multiple attack vectors, having fallbacks available is in line with general security recommendations depending on the respective use case and threat model [27, 56].”
BackgroundEnforced Community Standards for Research on Users of the Tor Anonymity Network
Soghoian, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29889-9_13 · Cited by 27
“Over the past few years, the Tor network has grown from an academic research project [4] to one of the most widely used privacy enhancing technologies, with several hundreds thousand of active users [9].”
BackgroundPrivacy-preserving data infrastructure for smart home appliances based on the Octopus DHT
Fabian, B., & Feldhaus, T. (2014) · Computers in Industry · doi:10.1016/j.compind.2014.07.001 · Cited by 27
Lin, Z., & Hopper, N. (2010) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1866919.1866927 · Cited by 27
“Compared to the previous e.cient schemes, Jack signi.cantly reduces the communication and computation costs required of trusted parties while also weakening the trust placed in these parties.”
BackgroundOn the limits of provable anonymity
Gelernter, N., & Herzberg, A. (2013) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2517840.2517850 · Cited by 27
“We examine a simplified version of the Tor protocol [12], denoted by Simp-Tor .”
BackgroundInfluentialInferring Statistically Significant Hidden Markov Models
Yu, L., Schwier, J. M., Craven, R. M., Brooks, R. R., & Griffin, C. H. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.93 · Cited by 27
Rebound: Decoy routing on asymmetric routes via error messages
Ellard, D., Jones, C., Manfredi, V., Strayer, W. T., Thapa, B., Welie, M. L. V., & Jackson, A. W. (2015) · Conference on Local Computer Networks · doi:10.1109/lcn.2015.7366287 · Cited by 27
Personalization vs. Privacy in Big Data Analysis
Habegger, B., Hasan, O., Brunie, L., Bennani, N., Kosch, H., & Damiani, E. (2014) · Cited by 27
Preserving Patient's Anonymity for Mobile Healthcare System in IoT Environment
Baek, S., Seo, S.-H., & Kim, S. (2016) · International Journal of Distributed Sensor Networks · doi:10.1177/155014772171642 · Cited by 27
Ubiquitous Access to Digital Cultural Heritage
Seifert, C., Werner Bailer, A., Orgel, T., Gantner, L., Kern, R., Ziak, H., Petit, A., Schlötterer, J., Zwicklbauer, S., & Granitzer, M. (2017) · Journal on Computing and Cultural Heritage · doi:10.1145/3012284 · Cited by 27
“To solve this issue, anonymous protocols (e.g., [Goldschlag et al. 1999; Dingledine et al. 2004; Ben Mokhtar et al. 2013]) ensure, with cryptographic primitives, that all third parties in the system cannot access both the user identity and the content of her query.”
MethodSupporting the design of privacy-aware business processes via privacy process patterns
Diamantopoulou, V., Argyropoulos, N., Kalloniatis, C., & Gritzalis, S. (2017) · International Conference on Research Challenges in Information Science (RCIS) · doi:10.1109/rcis.2017.7956536 · Cited by 27
Exploring and Analyzing the Tor Hidden Services Graph
Bernaschi, M., Celestini, A., Guarino, S., & Lombardi, F. (2017) · ACM Transactions on the Web · doi:10.1145/3008662 · Cited by 34
“The Onion Router (Tor 1 ) network is an anonymous communication network leveraging an implementation of the onion routing protocol [Dingledine et al. 2004].”
Distributed Measurement with Private Set-Union Cardinality
Fenske, E., Mani, A., Johnson, A., & Sherr, M. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134034 · Cited by 27
“[19] uses differential privacy [15] to privately collect statistics about the Tor network [14].”
Niu, Y., Wei, L., Zhang, C., Liu, J., & Fang, Y. M. (2017) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccchina.2017.8330337 · Cited by 27
How far can we push flow analysis to identify encrypted anonymity network traffic?
Shahbar, K., & Zincir-Heywood, N. (2018) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2018.8406156 · Cited by 27
Decentralized Privacy-Preserving Timed Execution in Blockchain-Based Smart Contract Platforms
Li, C., & Palanisamy, B. (2018) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc.2018.00037 · Cited by 28
Privacy Enhanced Technologies: Methods – Markets – Misuse
Federrath, H. (2005) · Lecture notes in computer science · doi:10.1007/11537878_1 · Cited by 32
Incorporating privacy requirements into the system design process: The PriS conceptual framework
Kavakli, E., Kalloniatis, C., Loucopoulos, P., & Gritzalis, S. (2006) · Internet Research · doi:10.1108/10662240610656483 · Cited by 41
Thunder in the Clouds: Security challenges and solutions for federated Clouds
Bernsmed, K., Jaatun, M. G., Meland, P. H., & Undheim, A. (2012) · IEEE International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2012.6427547 · Cited by 27
Privacy for Profitable Location Based Services
Kölsch, T., Fritsch, L., Kohlweiss, M., & Kesdoğan, D. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-32004-3_18 · Cited by 34
Decentralized Privacy-preserving Timed Execution in Blockchain-based Smart Contract Platforms
Li, C., & Palanisamy, B. (2019) · arXiv · doi:10.48550/arxiv.1902.05613 · Cited by 27
Outsourced private information retrieval
Huang, Y., & Goldberg, I. (2013) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2517840.2517854 · Cited by 31
“Their experimental results show that the fastest scheme examined processes a PIR query on a 16 GB database in less than 10 seconds, over 3 orders of magnitude (1000 times) faster than downloading the database over a 10 Mb/s network.”
MethodTransparent network services via a virtual traffic layer for virtual machines
Lange, J. R., & Dinda, P. A. (2007) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/1272366.1272370 · Cited by 26
Lynx: Authenticated anonymous real-time reporting of electric vehicle information
Li, H., Dán, G., & Nahrstedt, K. (2015) · IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgridcomm.2015.7436366 · Cited by 26
A First Look into Transnational Routing Detours
Edmundson, A., Ensafi, R., Feamster, N., & Rexford, J. (2016) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2934872.2959081 · Cited by 26
ViewMap: Sharing Private In-Vehicle Dashcam Videos.
Kim, M., Lim, J., Yu, H., Kim, K., Kim, Y., & Lee, S.-B. (2017) · Networked Systems Design and Implementation · Cited by 26
OTTer: A Scalable High-Resolution Encrypted Traffic Identification Engine
Papadogiannaki, E., Halevidis, C., Akritidis, P., & Koromilas, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00470-5_15 · Cited by 30
Wu, Y., Edwards, W. K., & Das, S. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833757 · Cited by 37
“Tor [87], of course, is the well-known onion network that relays users’ encrypted traffic through random network nodes to conceal their Internet activity.”
BackgroundPrivacy-Preserving Computation
Kerschbaum, F. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54069-1_3 · Cited by 29
Privacy-enhanced architecture for smart metering
Mármol, F. G., Sorge, C., Petrlic, R., Ugus, O., Westhoff, D., & Pérez, G. M. (2012) · International Journal of Information Security · doi:10.1007/s10207-012-0181-6 · Cited by 26
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.