Skip to main content
SpringerLink
Log in

Anonymity in the Wild: Mixes on Unstructured Networks

  • Conference paper
Privacy Enhancing Technologies (PET 2007)

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

Included in the following conference series:

Abstract

As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network topologies where mixes are placed on the nodes of an unstructured network, such as social networks and scale-free random networks. We explore the efficiency and traffic analysis resistance properties of mix networks based on unstructured topologies as opposed to theoretically optimal structured topologies, under high latency conditions. We consider a mix of directed and undirected network models, as well as one real world case study – the LiveJournal friendship network topology. Our analysis indicates that mix-networks based on scale-free and small-world topologies have, firstly, mix-route lengths that are roughly comparable to those in expander graphs; second, that compromise of the most central nodes has little effect on anonymization properties, and third, batch sizes required for warding off intersection attacks need to be an order of magnitude higher in unstructured networks in comparison with expander graph topologies.

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. Albert, R., Barabási, A.: Statistical mechanics of complex networks (2002)

    Google Scholar 

  2. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 171–180. ACM Press, New York (2000)

    Chapter  Google Scholar 

  3. Borisov, N.: Phd thesis: Anonymous routing in structured peer-to-peer overlays (April 2005)

    Google Scholar 

  4. Borisov, N.: Private communication (June 2007)

    Google Scholar 

  5. 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 

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

    Google Scholar 

  7. Clarke, I., Sandberg, O., Wiley, B., Hong, T.: Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp. 46–66 (July 2000)

    Google Scholar 

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

    Google Scholar 

  9. Danezis, G.: Private communication (July 2007)

    Google Scholar 

  10. Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: IEEE Symposium on Security and Privacy, pp. 2–15 (2003)

    Google Scholar 

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

    Google Scholar 

  12. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium (August 2004)

    Google Scholar 

  13. Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM conference on Computer and communications security, pp. 41–47. ACM Press, New York (2002)

    Chapter  Google Scholar 

  14. Erdos, P., Rnyi, A.: On random graphs. Publicationes Mathemticae (Debrecen) 6, 290–297 (1959)

    Google Scholar 

  15. Gillman, D.: A chernoff bound for random walks on expander graphs. SIAM J. Comput. 27(4), 1203–1220 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Granovetter, M.S.: The strength of weak ties. The American Journal of Sociology 78(6), 1360–1380 (1973)

    Article  Google Scholar 

  17. Kesdogan, D., Agrawal, D., Penz, S.: Limits of anonymity in open environments. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, Springer, Heidelberg (2003)

    Google Scholar 

  18. Klingberg, T., Manfredi, R.: ”gnutella 0.6” (June 2002)

    Google Scholar 

  19. Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)

    Google Scholar 

  20. Mihail, M., Papadimitriou, C., Saberi, A.: On certain connectivity properties of the internet topology. In: FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, p. 28. IEEE Computer Society, Washington (2003)

    Chapter  Google Scholar 

  21. Motwani, R., Raghavan, P.: Randomized Algorithms, vol. 1. Cambridge Univ. Press, Motwani (1995)

    MATH  Google Scholar 

  22. Newman, M.E.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404–409 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Newman, M.E.J.: Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Phys. Rev. E 64(1), 016132 (June 2001)

    Google Scholar 

  24. Newman, M.E.J.: Scientific collaboration networks. i. networks construction and fundamental results. Phys. Rev. E 64(1), 016131 (June 2001)

    Google Scholar 

  25. Newman, M.E.J.: Mixing patterns in networks. Physical Review E 67, 026126 (2003)

    Google Scholar 

  26. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  27. Pfitzmann, A., Hansen, M.: Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft (July 2000)

    Google Scholar 

  28. Pfitzmann, A., Pfitzmann, B., Waidner, M.: ISDN-mixes: Untraceable communication with very small bandwidth overhead. In: GI/ITG Conference on Communication in Distributed Systems, pp. 451–463 (February 1991)

    Google Scholar 

  29. Randall, D.: Rapidly mixing markov chains with applications in computer science and physics. Computing in Science and Engineering 8(2), 30–41 (2006)

    Article  Google Scholar 

  30. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6(1) (August 2002)

    Google Scholar 

  31. Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. 1(1), 66–92 (1998)

    Article  Google Scholar 

  32. Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications 16(4) (1998)

    Google Scholar 

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

    Chapter  Google Scholar 

  34. Sinclair, A.: Algorithms for random generation and counting: a Markov chain approach. Birkhauser Verlag, Basel, Switzerland (1993)

    Google Scholar 

  35. Syverson, P., Tsudik, G., Reed, M., Landwehr, C.: Towards an Analysis of Onion Routing Security. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 96–114. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  36. West, D.B: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, JJ Thomson Avenue, Cambridge CB3 0FD, UK

    Shishir Nagaraja

Authors
  1. Shishir Nagaraja
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nikita Borisov Philippe Golle

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagaraja, S. (2007). Anonymity in the Wild: Mixes on Unstructured Networks. In: Borisov, N., Golle, P. (eds) Privacy Enhancing Technologies. PET 2007. Lecture Notes in Computer Science, vol 4776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75551-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75551-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75550-0

  • Online ISBN: 978-3-540-75551-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation