Scalable onion routing with torsk

doi:10.1145/1653662.1653733

SIGN IN SIGN UP

Scalable onion routing with torsk

Full Text:

PDF

Buy this Article

Authors:	Jon McLachlan	University of Minnesota, Minneapolis, MN, USA
	Andrew Tran	Carnegie Mellon University, Pittsburgh, PA, USA
	Nicholas Hopper	University of Minnesota, Minneapolis, MN, USA
	Yongdae Kim	University of Minnesota, Minneapolis, MN, USA

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 9 · Downloads (12 Months): 92 · Citation Count: 10

Published in:

	· Proceeding
	CCS '09 Proceedings of the 16th ACM conference on Computer and communications security
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-894-0 doi>10.1145/1653662.1653733

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- CCS'12

Share:

|

Tags: algorithms anonymous communication distributed systems peer-to-peer networks security security and protection

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder