Abstract
This paper describes an architecture, Onion Routing, that limits a network's vulnerability to traffic analysis. The architecture provides anonymous socket connections by means of proxy servers. It provides real-time, bi-directional, anonymous communication for any protocol that can be adapted to use a proxy service. Specifically, the architecture provides for bi-directional communication even though no-one but the initiator's proxy server knows anything but previous and next hops in the communication chain. This implies that neither the respondent nor his proxy server nor any external observer need know the identity of the initiator or his proxy server. A prototype of Onion Routing has been implemented. This prototype works with HTTP (World Wide Web) proxies. In addition, an analogous proxy for TELNET has been implemented. roxies for FTP and SMTP are under development.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, v. 24, n. 2, Feb. 1981, pages 84–88.
D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology, 1/1, 1988, pages 65–75.
S. Chuang. Security Management of ATM Networks, Ph.D. thesis, in progress, Cambridge University.
D. E. Comer. Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architecture, Prentice-Hall, Engelwood Cliffs, New Jersey, 1995.
L. Cottrell. Mixmaster and Remailer Attacks, http://obscura.obscura.com/∼loki/remailer/remailer-essay.html
C. Gulcu and G. Tsudik. Mixing Email with Babel, 1996 Symposium on Network and Distributed System Security, San Diego, February 1996.
A. Pfitzmann and B. Pfitzmann. How to Break the Direct RSA-implementation of MIXes, Advances in Cryptology-EUROCRYPT '89 Proceedings, Springer-Verlag, Berlin, 1990, pages 373–381.
A. Pfitzmann, B. Pfitzmann, and M. Waidner. ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead, GI/ITG Conference: Communication in Distributed Systems, Mannheim Feb, 1991, Informatik-Fachberichte 267, Springer-Verlag, Heildelberg 1991, pages 451–463.
A. Pfitzmann and M. Waidner. Networks Without User Observability, Computers & Security, 6/2 1987, pages 158–166.
B. Schneier. Applied Cryptography: Protocols, Algorithms and Source Code in C, John Wiley and Sons, 1994.
W. R. Stevens. TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the UNIX Domain Protocols, Addison-Wesley, Reading, Mass., 1996.
L. D. Stein. How to Set up and Maintain a World Wide Web Site: The Guide for Information Providers, Addison-Wesley, Reading, Mass., 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldschlag, D.M., Reed, M.G., Syverson, P.F. (1996). Hiding Routing information. In: Anderson, R. (eds) Information Hiding. IH 1996. Lecture Notes in Computer Science, vol 1174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61996-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-61996-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61996-3
Online ISBN: 978-3-540-49589-5
eBook Packages: Springer Book Archive