LIRA: Lightweight Incentivized Routing for Anonymity

20th Annual Network and Distributed System Security Symposium, NDSS 2013

Volumn , Issue , 2013, Pages

  Jansen, Rob ^a   Johnson, Aaron ^a   Syverson, Paul ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

BANDWIDTH RESOURCE; CAPACITY LIMIT; ONION ROUTING; PERFORMANCE; PERFORMANCE AND SCALABILITIES; PERFORMANCE PROBLEMS; ROUTING NETWORKS; ROUTINGS; SCALABILITY PROBLEMS; TOR NETWORKS;

SCALABILITY;

EID: 84883308148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (53)

1. D. M. Goldschlag, M. G. Reed, and P. F. Syverson, “Hiding routing information, ” in Information Hiding: First International Workshop, R. Anderson, Ed. Springer-Verlag, LNCS 1174, 1996, pp. 137-150.
2. R. Dingledine, N. Mathewson, and P. Syverson, “Tor: The second-generation onion router, ” in Proceedings of the 13th USENIX Security Symposium. USENIX Association, August 2004, pp. 303-319.
3. “The Tor Project, ” https://www.torproject.org/.
4. L. Overlier and P. Syverson, “Locating hidden servers, ” in Security and Privacy, 2006 IEEE Symposium on. IEEE, 2006, pp. 15-pp.
5. M. Wright, M. Adler, B. N. Levine, and C. Shields, “Defending anonymous communication against passive logging attacks, ” in Proceedings of the 2003 IEEE Symposium on Security and Privacy, May 2003, pp. 28-43.
6. R. Dingledine and N. Mathewson, “Anonymity loves company: Usability and the network effect, ” in Fifth Workshop on the Economics of Information Security (WEIS 2006), R. Anderson, Ed., June 2006.
7. P. Syverson, “Why I'm not an entropist, ” in Seventeenth International Workshop on Security Protocols. Springer-Verlag, LNCS, 2009, forthcoming.
8. R. Dingledine and S. Murdoch, “Performance improvements on tor or, why tor is slow and what were going to do about it, ” Online: http://www. torproject. org/press/presskit/2009-03-11-performance.pdf, 2009.
9. W. B. Moore, C. Wacek, and M. Sherr, “Exploring the potential benefits of expanded rate limiting in tor: Slow and steady wins the race with tortoise, ” in Proceedings of 2011 Annual Computer Security Applications Conference (ACSAC'11), Orlando, FL, USA, December 2011.
10. R. Jansen, P. Syverson, and N. Hopper, “Throttling tor bandwidth parasites, ” in Proceedings of the 21st USENIX Security Symposium. Internet Society, August 2012.
11. C. Tang and I. Goldberg, “An improved algorithm for Tor circuit scheduling, ” in CCS'10: Proceedings of the 13th ACM Conference on Computer and Communications Security. ACM, 2010, pp. 329-339.
12. M. AlSabah, K. Bauer, I. Goldberg, D. Grunwald, D. McCoy, S. Savage, and G. Voelker, “Defenestrator: Throwing out windows in tor, ” in Privacy Enhancing Technologies. Springer, 2011, pp. 134-154.
13. T. Wang, K. Bauer, C. Forero, and I. Goldberg, “Congestion-aware Path Selection for Tor, ” in 16th International Conference on Financial Cryptography and Data Security (FC), 2012.
14. “Torservers.net, ” https://www.torservers.net/.
15. “The EFF Tor Challenge, ” https://www.eff.org/torchallenge/.
16. “Turning funding into more exit relays, ” https://blog.torproject.org/blog/turning-funding-more-exit-relays, July 2012.
17. R. Snader and N. Borisov, “A tune-up for Tor: Improving security and performance in the Tor network, ” in Proceedings of the Network and Distributed Security Symposium - NDSS'08. Internet Society, February 2008.
18. T.-W. J. Ngan, R. Dingledine, and D. S. Wallach, “Building incentives into Tor, ” in Proceedings of Financial Cryptography (FC'10), R. Sion, Ed., January 2010.
19. E. Androulaki, M. Raykova, S. Srivatsan, A. Stavrou, and S. M. Bellovin, “PAR: Payment for anonymous routing, ” in Privacy Enhancing Technologies: 8th International Symposium, PETS 2008, N. Borisov and I. Goldberg, Eds. Leuven, Belgium: Springer-Verlag, LNCS 5134, July 2008, pp. 219-236.
20. Y. Chen, R. Sion, and B. Carbunar, “XPay: Practical anonymous payments for Tor routing and other networked services, ” in Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2009). ACM, November 2009.
21. R. Jansen, N. Hopper, and Y. Kim, “Recruiting new Tor relays with BRAIDS, ” in Proceedings of the 2010 ACM Conference on Computer and Communications Security, CCS 2010, Chicago, Illinois, USA, October 4-8, 2010, A. D. Keromytis and V. Shmatikov, Eds. ACM, 2010.
22. C. Dovrolis and P. Ramanathan, “A case for relative differentiated services and the proportional differentiation model, ” Network, IEEE, vol. 13, no. 5, pp. 26-34, 1999.
23. “Tor Metrics Portal, ” http://metrics.torproject.org/.
24. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr, “Towards an analysis of onion routing security, ” in Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Springer-Verlag, LNCS 2009, July 2000, pp. 96-114.
25. D. Chaum, “Security without identification: transaction systems to make big brother obsolete, ” Commun. ACM, vol. 28, no. 10, pp. 1030-1044, Oct. 1985. [Online]. Available: http://doi.acm.org/10.1145/4372.4373
26. R. Snader and N. Borisov, “Eigenspeed: secure peer-to-peer bandwidth evaluation, ” in Proceedings of the 8th international conference on Peer-to-peer systems, ser. IPTPS'09. Berkeley, CA, USA: USENIX Association, 2009, pp. 9-9. [Online]. Available: http://dl.acm.org/citation.cfm?id=1855663.1855672
27. M. Luby and C. Rackoff, “How to construct pseudorandom permutations from pseudorandom functions, ” SIAM J. Comput., vol. 17, no. 2, pp. 373-386, Apr. 1988. [Online]. Available: http://dx.doi.org/10.1137/0217022
28. E. De Cristofaro, C. Soriente, G. Tsudik, and A. Williams, “Hummingbird: privacy at the time of twitter, ” in 33rd IEEE Symposium on Security and Privacy. IEEE, 2012.
29. D. McCoy, K. Bauer, D. Grunwald, T. Kohno, and D. Sicker, “Shining light in dark places: Understanding the Tor network, ” in Privacy Enhancing Technologies: 8th International Symposium, PETS 2008, N. Borisov and I. Goldberg, Eds. Leuven, Belgium: Springer-Verlag, LNCS 5134, July 2008, pp. 63-76.
30. S. Ramachandran, “Web metrics: Size and number of resources, ” http://code.google.com/speed/articles/web-metrics.html, 2010.
31. X. Cheng, C. Dale, and J. Liu, “Statistics and social network of youtube videos, ” in In the Proceeding of the 16th IEEE International Workshop on Quality of Service (IWQoS), 2008, pp. 229-238.
32. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, “An architecture for differentiated service, ” United States, 1998.
33. C. Dovrolis, D. Stiliadis, and P. Ramanathan, “Proportional differentiated services: Delay differentiation and packet scheduling, ” IEEE/ACM Transactions on Networking (TON), vol. 10, no. 1, pp. 12-26, 2002.
34. J. Feigenbaum, A. Johnson, and P. Syverson, “Probabilistic analysis of onion routing in a black-box model, ” in Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society (WPES 2007), 2007, pp. 1-10.
35. N. Evans, R. Dingledine, and C. Grothoff, “A practical congestion attack on tor using long paths, ” in Proceedings of the 18th USENIX Security Symposium, August 2009.
36. N. Hopper, E. Y. Vasserman, and E. Chan-Tin, “How much anonymity does network latency leak?” ACM Transactions on Information and System Security, vol. 13, no. 2, February 2010.
37. N. Borisov, G. Danezis, P. Mittal, and P. Tabriz, “Denial of service or denial of security? How attacks on reliability can compromise anonymity, ” in Proceedings of CCS 2007, October 2007.
38. M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani, “Do incentives build robustness in BitTorrent?” in Proceedings of the 4th USENIX Symposium on Networked Systems Design & Implementation (NSDI 2007). USENIX, Apr. 2007. [Online]. Available: http://www.usenix.org/events/nsdi07/tech/piatek/piatek.pdf
39. T. Locher, P. Moor, S. Schmid, and R. Wattenhofer, “Free Riding in BitTorrent is Cheap, ” in 5th Workshop on Hot Topics in Networks (HotNets), Irvine, California, USA, November 2006.
40. R. Jansen and N. Hopper, “Shadow: Running Tor in a box for accurate and efficient experimentation, ” in Proceedings of the Network and Distributed System Security Symposium - NDSS'12. Internet Society, February 2012.
41. “Shadow Code, ” http://github.com/shadow/.
42. R. Jansen, K. Bauer, N. Hopper, and R. Dingledine, “Methodically Modeling the Tor Network, ” in Proceedings of the 5th Workshop on Cyber Security Experimentation and Test, August 2012.
43. “MaxMind GeoIP, ” http://www.maxmind.com/.
44. H. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani, “iPlane: An Information Plane for Distributed Services, ” in Proc. of USENIX OSDI, 2006, pp. 367-380.
45. “iPlane: Datasets, ” http://iplane.cs.washington.edu/data/data.html.
46. “Net Index Dataset, ” http://www.netindex.com/source-data/.
47. A. Chaabane, P. Manils, and M. Kaafar, “Digging into anonymous traffic: A deep analysis of the tor anonymizing network, ” in Network and System Security (NSS), 2010 4th International Conference on. IEEE, 2010, pp. 167-174.
48. “TorPerf measurement tools, ” https://gitweb.torproject.org/torperf.git/.
49. E. Franz, A. Jerichow, and G. Wicke, “A payment scheme for mixes providing anonymity, ” Trends in Distributed Systems for Electronic Commerce, pp. 94-108, 1998.
50. D. R. Figueiredo, J. K. Shapiro, and D. Towsley, “Using payments to promote cooperation in anonymity protocols, ” 2003.
51. M. Reiter, X. Wang, and M. Wright, “Building reliable mix networks with fair exchange, ” in Applied Cryptography and Network Security. Springer, 2005, pp. 159-173.
52. A. Acquisti, R. Dingledine, and P. Syverson, “On the economics of anonymity, ” in Financial Cryptography. Springer-Verlag, LNCS 2742, 2003, pp. 84-102.
53. M. Humbert, M. Manshaei, and J.-P. Hubaux, “One-to-n scrip systems for cooperative privacy-enhancing technologies, ” in Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, 2011.