skip to main content
article
Free Access

Onion routing

Published:01 February 1999Publication History
First page image

References

  1. 1 Bleichenbacher,, D., Gabber, E., Gibbons, P., Matias, Y., and Mayer, A. On secure and pseudonymous client-relationships with multiple servers. In Proceedings for the Third USENIX Electronic Commerce Workshop (Boston, Sept. 1998) 99-108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (Feb. 1981), 84-88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Goldschlag, D., Reed, M., and Syverson, P. Hiding routing information. Information Hiding. R. Anderson, (Ed). LNCS, 1996. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Goldberg, I. and Wagner, D. TAZ servers and the Rewebber network: Enabling anonymous publishing on the World Wide Web. First Mon-day3, 4 (April 1998).Google ScholarGoogle Scholar
  5. 5 Reed, M., Syverson, P., and Goldschlag, D. Anonymous connections and Onion Routing. IEEE J. Selected Areas in Commun. 16, 4 (May 1998), 482-494. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Syverson, P., Reed, M., and Goldschlag, D. Private Web browsing. J. Comput. Sec. 5, 3 (1997) 237-248. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Onion routing

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Communications of the ACM
                Communications of the ACM  Volume 42, Issue 2
                Feb. 1999
                83 pages
                ISSN:0001-0782
                EISSN:1557-7317
                DOI:10.1145/293411
                Issue’s Table of Contents

                Copyright © 1999 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 February 1999

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader

              HTML Format

              View this article in HTML Format .

              View HTML Format