The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Anonymous connections and onion routing
Abstract
Onion routing provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Unmodified Internet applications can use these anonymous connections by means of proxies. The proxies may also make communication anonymous by removing identifying information from the data stream. Onion routing has been implemented on Sun Solaris 2.X with proxies for Web browsing, remote logins and e-mail. This paper's contribution is a detailed specification of the implemented onion routing system, a vulnerability analysis based on this specification, and performance results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Comer, D. E. (1988) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 1,245
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Anonymous connections and onion routing
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-citationAnalyzing and comparing Montgomery multiplication algorithms
Kaya Koc, C., Acar, T., & Kaliski, B. S. (1996) · IEEE Micro · doi:10.1109/40.502403 · Cited by 563
Goldschlag, D. M., Reed, M. G., & Syverson, P. F. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_37 · Cited by 494
Self-citationGulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
Cited by
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
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-citation(2001) · Cited by 1,052
Tarzan: 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
Taxonomy of trust: Categorizing P2P reputation systems
Marti, S., & Garcia-Molina, H. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.011 · Cited by 433
Software engineering for security: a roadmap
Devanbu, P. T., & Stubblebine, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336559 · Cited by 418
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnar, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_5 · Cited by 336
Privacy-preserving collaborative filtering using randomized perturbation techniques
Polat, H., & Du, W. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250993 · Cited by 314
Towards an Analysis of Onion Routing Security
Syverson, P., Tsudik, G., Reed, M., & Landwehr, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_6 · Cited by 302
Self-citationAnonymous Web transactions with Crowds
Reiter, M. K., & Rubin, A. D. (1999) · Communications of the ACM · doi:10.1145/293411.293778 · Cited by 286
Verifying privacy-type properties of electronic voting protocols
Delaune, S., Kremer, S., & Ryan, M. (2009) · Journal of Computer Security · doi:10.3233/jcs-2009-0340 · Cited by 285
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses
Shmatikov, V., & Wang, M.-H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11863908_2 · Cited by 273
Security issues and requirements for Internet-scale publish-subscribe systems
Wang, C., Carzaniga, A., Evans, D., & Wolf, A. L. (2003) · Proceedings of the 35th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2002.994531 · Cited by 176
Statistical Disclosure or Intersection Attacks on Anonymity Systems
Danezis, G., & Serjantov, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30114-1_21 · Cited by 131
Metadata
- Authors
- Syverson, P. F., Goldschlag, D. M., & Reed, M. G.
- Venue
- Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097)
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 44-54
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2123735079
- Cited by
- 629
- References
- 14
- FWCI
- 42.68
- Type
- conference paper
- Language
- en
- Open access
- closed
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.