Computer Science – Cryptography and Security
Scientific paper
2007-06-04
Computer Science
Cryptography and Security
published in Privacy Enhancing Technologies 2007, Ottawa
Scientific paper
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.
No associations
LandOfFree
Anonymity in the Wild: Mixes on unstructured networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Anonymity in the Wild: Mixes on unstructured networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anonymity in the Wild: Mixes on unstructured networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726775