Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection

By Marc Rennhard, Bernhard Plattner. 2002

372 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Prateek Mittal
2. Nikita Borisov
3. George Danezis
4. Peter Druschel
5. Wenxuan Zhou
6. Femi G. Olumofin
7. Ian Goldberg

In Computer Networks and Communications

1. Prateek Mittal
2. Nikita Borisov
3. Martin Vuagnoux
4. Sylvain Pasini
5. George Danezis
6. Ian Goldberg
7. Steven J. Murdoch
8. Peter Druschel

Citations in the corpus

• Compromising Electromagnetic Emanations of Wired and Wireless Keyboards (2009, background): “[33] TANAKA, H.”
• Towards efficient traffic-analysis resistant anonymity networks (2013, background): “P2P networks [12, 24] are inherently robust to network edge analysis, because an attacker cannot distinguish whether a node is the source, destination or relay of traffic.”
• Low-cost traffic analysis of Tor (2005, background): “Tor, on the other hand, like some other designs, most notably MorphMix [36] and Tarzan [21] [20], assumes a much weaker threat model.”
• ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies (2009, background): “Indeed, several proposals for peer-to-peer anonymous communication have been put forward [18,28,33,38].”
• PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval (2011, background): “In MorphMix [38] the scalability problem in Tor is alleviated by organizing relays in an unstructured peer-to-peer overlay, where each relay has knowledge of only a few other relays in the system.”