Skip to main content
SpringerLink
Log in

A Parallelism-Based Approach to Network Anonymization

  • Conference paper
Identity and Privacy in the Internet Age (NordSec 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5838))

Included in the following conference series:

Abstract

Considering topologies of anonymous networks we used to organizing anonymous communications into hard to trace paths, composed of several middleman nodes, towards hiding communication’s origin or destination. In anonymity the company is crucial. However, the serial transportation of content imposes a costly tradeoff between speed of communication and a level of privacy.

This paper introduces a framework of a novel architecture for anonymous networks that hides initiators of communications by parallelization of anonymous links. The new approach, which is based on the grounds of the anonymous P2P network called P2Priv, does not require content forwarding via a chain of proxy nodes to assure high degree of anonymity. Contrary to P2Priv, the new architecture can be suited to anonymization of various network communications, including anonymous access to distributed as well as client-server services. In particular, it can be considered as an anonymization platform for these network applications where both privacy and low delays are required.

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

Access this chapter

Log in via an institution
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.

References

  1. Dingledine, R., Mathewson, N.: Anonymity loves company: Usability and the network effect. In: Anderson, R. (ed.) Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS 2006), Cambridge, UK (June 2006)

    Google Scholar 

  2. Danezis, G., Wittneben, B.: The economics of mass surveillance and the questionable value of anonymous communications. In: Anderson, R. (ed.) Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS 2006), Cambridge, UK (June 2006)

    Google Scholar 

  3. Diaz, C., Sassaman, L., Dewitte, E.: Comparison between two practical mix designs. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 141–159. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding Routing Information. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 137–150. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. Margasinski, I., Pioro, M.: A concept of an anonymous direct p2p distribution overlay system. In: Proceedings of IEEE 22nd International Conference on Advanced Information Networking and Applications (AINA), pp. 590–597. IEEE Computer Society Press, Los Alamitos (2008)

    Google Scholar 

  6. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 4(2) (February 1981)

    Google Scholar 

  7. Berthold, O., Pfitzmann, A., Standtke, R.: The disadvantages of free MIX routes and how to overcome them. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 30–45. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Dingledine, R., Shmatikov, V., Syverson, P.F.: Synchronous batching: From cascades to free routes. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 186–206. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Danezis, G.: Mix-networks with restricted routes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 1–17. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Böhme, R., Danezis, G., Diaz, C., Köpsell, S., Pfitzmann, A.: Mix cascades vs. peer-to-peer: Is one concept superior? In: Privacy Enhancing Technologies (PET 2004) (2004)

    Google Scholar 

  11. Cottrell, L.: Mixmaster and remailer attacks (1994), http://obscura.obscura.com/loki/remailer/remailer-essay.html

  12. Gülcü, C., Tsudik, G.: Mixing E-mail with Babel. In: Proceedings of the Network and Distributed Security Symposium - NDSS 1996, pp. 2–16. IEEE, Los Alamitos (1996)

    Google Scholar 

  13. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, San Diego, CA, USA, pp. 303–320 (August 2004)

    Google Scholar 

  14. Reiter, M., Rubin, A.: Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security 1(1) (June 1998)

    Google Scholar 

  15. Camenisch, J., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169–187. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Margasinski, I., Pioro, M.: Low-latency parallel transport in anonymous peer-to-peer overlays. In: Akar, N., Pioro, M., Skianis, C. (eds.) IPOM 2008. LNCS, vol. 5275, pp. 127–141. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Díaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 54–68. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 41–53. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Margasinski, I.: Anonymous Transport in Peer-to-Peer Overlay Networks. PhD thesis, Warsaw University of Technology (June 2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telecommunications, Warsaw University of Technology, Poland

    Igor Margasiński

Authors
  1. Igor Margasiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Oslo, University Graduate Center, Kjeller, Norway

    Audun Jøsang

  2. Norwegian Defence Research Establishment, Kjeller, Norway

    Torleiv Maseng

  3. Norwegian University of Science and Technology, Centre for Quantifiable Quality of Service in Communication Systems, Trondheim, Norway

    Svein Johan Knapskog

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Margasiński, I. (2009). A Parallelism-Based Approach to Network Anonymization. In: Jøsang, A., Maseng, T., Knapskog, S.J. (eds) Identity and Privacy in the Internet Age. NordSec 2009. Lecture Notes in Computer Science, vol 5838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04766-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04766-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04765-7

  • Online ISBN: 978-3-642-04766-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation