Nothing Special   »   [go: up one dir, main page]

Skip to main content

Analyzing the Gold Star Scheme in a Split Tor Network

  • Conference paper
Security and Privacy in Communication Networks (SecureComm 2011)

Abstract

Tor is an anonymity network and two challenges in Tor are (i) to overcome the scalability problems of Tor’s current network information distribution scheme, and (ii) to motivate users to become operators of nodes. Several solutions have been proposed to address these challenges. We investigate the ramifications of combining two seemingly promising proposals, i.e., splitting the Tor network into several sub-networks (for better scalability), while using the Gold Star scheme (for motivating users to become node operators). Through simulation, we show that the sub-networks are likely to end up in a state of highly imbalanced division of size and bandwidth. This threatens the security and worsens the scalability problem of Tor. We identify the ratio of nodes given a gold star and the fact that a gold star is solely awarded based on a node’s bandwidth, being highly skewed in practice, as two factors that contribute to an imbalanced split. We explore several potential mitigating strategies and discuss their strengths and shortcomings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Tor metric portal, http://metrics.torproject.org (last visited February 2011)

  2. Androulaki, E., Raykova, M., Srivatsan, S., Stavrou, A., Bellovin, S.M.: PAR: Payment for Anonymous Routing. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 219–236. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Chen, Y., Sion, R., Carbunar, B.: XPay: practical anonymous payments for tor routing and other networked services. In: WPES, pp. 41–50. ACM (2009)

    Google Scholar 

  4. Danezis, G., Clayton, R.: Route fingerprinting in anonymous communications. In: Peer-to-Peer Computing, pp. 69–72. IEEE Computer Society (2006)

    Google Scholar 

  5. Danezis, G., Syverson, P.F.: Bridging and Fingerprinting: Epistemic Attacks on Route Selection. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 151–166. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: USENIX Security, pp. 303–320. USENIX (2004)

    Google Scholar 

  7. Dingledine, R., Syverson, P.F.: Reliable MIX Cascade Networks Through Reputation. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 253–268. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Freedman, M.J., Morris, R.: Tarzan: a peer-to-peer anonymizing network layer. In: CCS, pp. 193–206. ACM (2002)

    Google Scholar 

  9. Freedman, M.J., Sit, E., Cates, J., Morris, R.: Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 121–129. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Jansen, R., Hopper, N., Kim, Y.: Recruiting new tor relays with braids. In: CCS, pp. 319–328. ACM (2010)

    Google Scholar 

  11. Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. McLachlan, J., Tran, A., Hopper, N., Kim, Y.: Scalable onion routing with torsk. In: CCS, pp. 590–599. ACM (2009)

    Google Scholar 

  13. Mittal, P., Borisov, N.: Information leaks in structured peer-to-peer anonymous communication systems. In: CCS, pp. 267–278. ACM (2008)

    Google Scholar 

  14. Mittal, P., Borisov, N.: Shadowwalker: peer-to-peer anonymous communication using redundant structured topologies. In: CCS, pp. 161–172. ACM (2009)

    Google Scholar 

  15. Mittal, P., Olumofin, F., Troncoso, C., Borisov, N., Goldberg, I.: PIR-Tor: Scalable anonymous communication using private information retrieval. In: USENIX Security (2011)

    Google Scholar 

  16. Nambiar, A., Wright, M.: Salsa: a structured approach to large-scale anonymity. In: CCS, pp. 17–26. ACM (2006)

    Google Scholar 

  17. “Johnny” Ngan, T.-W., Dingledine, R., Wallach, D.S.: Building Incentives into Tor. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 238–256. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Panchenko, A., Richter, S., Rache, A.: Nisan: network information service for anonymization networks. In: CCS, pp. 141–150. ACM (2009)

    Google Scholar 

  19. Pfitzmann, A., Hansen, M.: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management - a consolidated proposal for terminology, v0.31 (February 2008)

    Google Scholar 

  20. Schuchard, M., Dean, A.W., Heorhiadi, V., Hopper, N., Kim, Y.: Balancing the shadows. In: WPES, pp. 1–10. ACM (2010)

    Google Scholar 

  21. Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, pp. 149–160 (2001)

    Google Scholar 

  22. Wang, P., Hopper, N., Osipkov, I., Kim, Y.: Myrmic: Secure and robust DHT Routing. Technical report, Uni. of Minnesota DTC Research (2006)

    Google Scholar 

  23. Wang, Q., Mittal, P., Borisov, N.: In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems. In: CCS, pp. 308–318. ACM (2010)

    Google Scholar 

  24. Wendolsky, R.: A volume-based accounting system for fixed-route mix cascade systems. In: Bamberger Beiträge zur Wirtschaftsinformatik und angewandten Informatik, pp. 26–33 (February 2008)

    Google Scholar 

  25. Westermann, B.: Security Analysis of AN.ON’s Payment Scheme. In: Jøsang, A., Maseng, T., Knapskog, S.J. (eds.) NordSec 2009. LNCS, vol. 5838, pp. 255–270. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  26. Westermann, B., Panchenko, A., Pimenidis, L.: A Kademlia-Based Node Lookup System for Anonymization Networks. In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T.-H., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol. 5576, pp. 179–189. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Westermann, B., Chia, P.H., Kesdogan, D. (2012). Analyzing the Gold Star Scheme in a Split Tor Network. In: Rajarajan, M., Piper, F., Wang, H., Kesidis, G. (eds) Security and Privacy in Communication Networks. SecureComm 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 96. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31909-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31909-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31908-2

  • Online ISBN: 978-3-642-31909-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics