Peer Discovery in Peer-to-Peer Anonymity Networks

Many peer-to-peer anonymity protocols have been proposed in recent years. One of the key challenges in designing such protocols is peer discovery, especially in decentralized unstructured peer-to-peer systems. In this paper, we propose a gossip algorithm for peer discovery based upon node local in-degree (GPDL), using only limited knowledge of the network topology. Our goal is try to discover peers uniformly in the whole network as well as try to discover robust nodes based upon local topology information. The idea behind our gossip is that the larger the degree of a node, the better its robustness. Our simulations show that the network under GPDL algorithm is high clustering, and its average diameter is almost not influenced by the node dynamics. With time passing, a node can discover robust nodes, and its neighbors are nearly selected uniformly from the whole network. The message overhead produced by GPDL is small

[1]  Tianbo Lu,et al.  Performance analysis of WonGoo system , 2005, The Fifth International Conference on Computer and Information Technology (CIT'05).

[2]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[3]  Richard P. Martin,et al.  PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[4]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[5]  Nick Feamster,et al.  Location diversity in anonymity networks , 2004, WPES '04.

[6]  Robert Tappan Morris,et al.  Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[8]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[9]  George Danezis,et al.  Mixminion: design of a type III anonymous remailer protocol , 2003, 2003 Symposium on Security and Privacy, 2003..

[10]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[11]  Tianbo Lu,et al.  Some Remarks on Universal Re-encryption and A Novel Practical Anonymous Tunnel , 2005, ICCNMC.

[12]  Tianbo Lu,et al.  WonGoo: A Peer-to-Peer Protocol for Anonymous Communication , 2004, PDPTA.

[13]  Aravind Srinivasan,et al.  P/sup 5/ : a protocol for scalable anonymous communication , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[14]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[15]  Andreas Pfitzmann,et al.  Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[16]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[17]  Peter Palfrader,et al.  Mixmaster protocol --- version 2 , 2000 .

[18]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[19]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).

[20]  Bernhard Plattner,et al.  Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection , 2002, WPES '02.

[21]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[22]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[23]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[24]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[25]  B. Bhattacharjee,et al.  A Protocol for Scalable Anonymous Communication , 1999 .

[26]  Dariusz R. Kowalski,et al.  Gossiping to reach consensus , 2002, SPAA '02.

[27]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[28]  Xiang-Yang Li,et al.  Regional Gossip Routing for Wireless Ad Hoc Networks , 2003, Mob. Networks Appl..