Greedy Embedding, Routing and Content Addressing for Darknets

To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties. Efficient data retrieval in such a restricted topology requires a decentralized addressing scheme. We propose a greedy embedding algorithm, which is used to realize efficient routing and content addressing for darknets. The embedding guarantees success of greedy routing using compact address representations. Evaluation on trust graphs obtained from PGP's web of trust shows that our embedding enables much more efficient routing than existing dark net embeddings. Though, content addressing based on the embedding exhibits unbalanced load.

[1]  Christian Grothoff,et al.  Routing in the Dark: Pitch Black , 2007, Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007).

[2]  Stefanie Roos,et al.  Attack Resistant Network Embeddings for Darknets , 2011, 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops.

[3]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[4]  Jie Gao,et al.  Navigation in Real-World Complex Networks through Embedding in Latent Spaces , 2010, ALENEX.

[5]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[6]  Huaming Zhang,et al.  Greedy Routing via Embedding Graphs onto Semi-metric Spaces , 2011, FAW-AAIM.

[7]  Gaogang Xie,et al.  FPC: A self-organized greedy routing in scale-free networks , 2012, 2012 IEEE Symposium on Computers and Communications (ISCC).

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

[9]  Matteo Dell'Amico.  Mapping Small Worlds , 2007 .

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

[11]  David Eppstein,et al.  Succinct Greedy Geometric Routing Using Hyperbolic Geometry , 2011, IEEE Transactions on Computers.

[12]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[13]  Cédric Westphal,et al.  Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.

[14]  Petar Maymounkov,et al.  Greedy Embeddings , Trees , and Euclidean vs . Lobachevsky Geometry , 2006 .

[15]  Andrew S. Tanenbaum,et al.  Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System , 2004, Security Protocols Workshop.

[16]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[17]  I. Clarke,et al.  Private Communication Through a Network of Trusted Connections : The Dark Freenet , 2010 .

[18]  Christian Grothoff,et al.  R5N: Randomized recursive routing for restricted-route networks , 2011, 2011 5th International Conference on Network and System Security.

[19]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

[20]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[21]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[22]  Nicholas Hopper,et al.  Membership-concealing overlay networks , 2009, CCS.

[23]  Yehuda Koren,et al.  On Spectral Graph Drawing , 2003, COCOON.

[24]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[25]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[26]  Prateek Mittal,et al.  X-Vine: Secure and Pseudonymous Routing Using Social Networks , 2011, ArXiv.

[27]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.

[28]  Thomas E. Anderson,et al.  Privacy-preserving P2P data sharing with OneSwarm , 2010, SIGCOMM '10.