Public-Key Based Routing In Internet For Anonymous Data Communication

We propose a new decentralized network structure for anonymous communications based on public-key addressing. Our structure, called PK-Routing (Public-Key Routing) consists of four sub-structures. These sub-structures can be used based on sender’s choice. The proposed structure is distinguished from other schemes by two features. First, it is constructed as a virtual peer-to-peer network that maintains traditional networks harmony. The second feature, showing the flexibility of our structure, allows each participant to trade-off between type and degree of anonymity for communication efficiency. We describe PK-Routing structure and present analysis and comparison of its anonymity with other works.

[1]  Paul F. Syverson,et al.  Hiding Routing Information , 1996, Information Hiding.

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

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

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

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

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

[7]  Andrew Schulman,et al.  Deanonymizing Users of the SafeWeb Anonymizing Service , 2002, USENIX Security Symposium.

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

[9]  Ramzi A. Haraty,et al.  I2P Data Communication System , 2011, ICON 2011.