NSDA: A Novel Node Selecting Optimal Algorithm Based on Dijkstra

This paper first represent the basic conceptions of anonymous communication, then introduce the fundamentals in Anonymous Communication. Afterwards, we went deep to the classification of anonymous network topological, therefore we could get a better understanding on P2P anonymous communication system. We also systematically analyzes the existing node-select algorithms. Furthermore, we propose and implement a new node selection algorithm based on Dijkstra algorithm, named NSDA algorithm. We give a belief description about the backgrounds and design of NSDA Algorithm. The algorithm can combine the node properties with link properties to select node, which can adjust the system performancing and anonymity. In order to evaluate the NSDA algorithm, we have done experiments in Network Simulator 3, and we also explain the reason why we choose Network Simulator 3 as the simulate tool. In the end, we analyze the characteristics of NSDA algorithm according to the results of experiments.

[1]  Ralf Küsters,et al.  Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking , 2014, 2014 IEEE Symposium on Security and Privacy.

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

[3]  Christian Grothoff,et al.  Privacy-Implications of Performance-Based Peer Selection by Onion-Routers: A Real-World Case Study Using I2P , 2011, PETS.

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

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

[6]  George Danezis.  Mix-Networks with Restricted Routes , 2003, Privacy Enhancing Technologies.

[7]  Gene Tsudik,et al.  Mixing E-mail with Babel , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.

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

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

[10]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[11]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[13]  U Moeller,et al.  Mixmaster Protocol Version 2 , 2004 .

[14]  Carmela Troncoso,et al.  Impact of Network Topology on Anonymity and Overhead in Low-Latency Anonymity Networks , 2010, Privacy Enhancing Technologies.

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

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

[17]  Christian Grothoff,et al.  An Excess-Based Economic Model for Resource Allocation in Peer-to-Peer Networks , 2005 .

[18]  Prateek Mittal,et al.  Pisces: Anonymous Communication Using Social Networks , 2013, NDSS.