research-article

Dealing with Dead Ends: Efficient Routing in Darknets

Authors:

Thorsten StrufeAuthors Info & Claims

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), Volume 1, Issue 1

Article No.: 4, Pages 1 - 30

https://doi.org/10.1145/2809779

Published: 22 February 2016 Publication History

Abstract

Darknets, membership-concealing peer-to-peer networks, suffer from high message delivery delays due to insufficient routing strategies. They form topologies restricted to a subgraph of the social network of their users by limiting connections to peers with a mutual trust relationship in real life. Whereas centralized, highly successful social networking services entail a privacy loss of their users, Darknets at higher performance represent an optimal private and censorship-resistant communication substrate for social applications.

Decentralized routing so far has been analyzed under the assumption that the network resembles a perfect lattice structure. Freenet, currently the only widely used Darknet, attempts to approximate this structure by embedding the social graph into a metric space. Considering the resulting distortion, the common greedy routing algorithm is adapted to account for local optima. Yet the impact of the adaptation has not been adequately analyzed.

We thus suggest a model integrating inaccuracies in the embedding. In the context of this model, we show that the Freenet routing algorithm cannot achieve polylog performance. Consequently, we design NextBestOnce, a provable poylog algorithm based only on information about neighbors. Furthermore, we show that the routing length of NextBestOnce is further decreased by more than a constant factor if neighbor-of-neighbor information is included in the decision process.

References

[1]

Sonja Buchegger, Doris Schiöberg, Le Hung Vu, and Anwitaman Datta. 2009. PeerSoN: P2P social networking. In Social Network Systems.

[2]

David L. Chaum. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (1981), 84--90.

Digital Library

[3]

Ian Clarke, Oskar Sandberg, Matthew Toseland, and Vilhelm Verendel. 2010. Private Communication Through a Network of Trusted Connections: The Dark Freenet. Retrieved from http://freenetproject.org/ papers.html.

[4]

Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. 2000. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the International Workshop on Design Issues in Anonymity and Unobservability.

Digital Library

[5]

Leucio-Antonio Cutillo, Refik Molva, and Thorsten Strufe. 2009. Privacy preserving social networking through decentralization. In Proceedings of the 6th International Conference on Wireless On-demand Network Systems and Services (WONS’09). 145--152.

Digital Library

[6]

Nathan S. Evans and Christian Grothoff. 2011. R5N: Randomized recursive routing for restricted-route networks. In Proceedings of the 5th International Conference on Network and System Security (NSS’11).

[7]

Pierre Fraigniaud and George Giakkoupis. 2009. The effect of power-laws on the navigability of small worlds. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, (PODC’09).

Digital Library

[8]

George Giakkoupis and Nicolas Schabanel. 2011. Optimal path search in small worlds: Dimension matters. In Proceedings of the 43rd Symposium on Theory of Computing (STOC’11).

Digital Library

[9]

Andreas Höfer, Stefanie Roos, and Thorsten Strufe. 2013. Greedy embedding, routing and content addressing for darknets. In Proceedings of the Conference on Networked Systems (NetSys’13).

Digital Library

[10]

Tomas Isdal, Michael Piatek, Arvind Krishnamurthy, and Thomas E. Anderson. 2010. Privacy-preserving P2P data sharing with OneSwarm. In Proceedings of the ACM SIGCOMM 2010 Conference (SIGCOMM’10).

Digital Library

[11]

Jon Kleinberg. 2000. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd Symposium on Theory of Computing (STOC’00).

Digital Library

[12]

Emmanuelle Lebhar and Nicolas Schabanel. 2004. Almost optimal decentralized routing in long-range contact networks. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP’04).

[13]

Gurmeet Singh Manku, Moni Naor, and Udi Wieder. 2004. Know thy neighbor’s neighbor: The power of lookahead in randomized P2P networks. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’04).

Digital Library

[14]

Chip Martel and Van Nguyen. 2003. The Complexity of Message Delivery in Kleinberg’s Small-World Model. Technical Report. UC Davis Department of Computer Science.

[15]

Chip Martel and Van Nguyen. 2004. Analyzing Kleinberg’s (and other) small-world models. In Proceedings of the 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC’04).

Digital Library

[16]

Jon McLachlan, Andrew Tran, Nicholas Hopper, and Yongdae Kim. 2009. Scalable onion routing with Torsk. In Proceedings of the 16th ACM Conference on Computer and Communications Security. ACM, 590--599.

Digital Library

[17]

Prateek Mittal and Nikita Borisov. 2009. ShadowWalker: Peer-to-peer anonymous communication using redundant structured topologies. In Proceedings of the 16th ACM Conference on Computer and Communications Security. ACM.

Digital Library

[18]

Prateek Mittal, Matthew Caesar, and Nikita Borisov. 2012. X-Vine: Secure and pseudonymous routing using social networks. In Proceedings of the 19th Annual Network & Distributed System Security Symposium (NDSS’’12).

[19]

Hooman Mohajeri Moghaddam, Baiyu Li, Mohammad Derakhshani, and Ian Goldberg. 2012. Skypemorph: Protocol obfuscation for tor bridges. In Proceedings of the 2012 ACM Conference on Computer and Communications Security. ACM, 97--108.

Digital Library

[20]

Andriy Panchenko, Stefan Richter, and Arne Rache. 2009. NISAN: Network information service for anonymization networks. In Proceedings of the 16th ACM Conference on Computer and Communications Security. ACM, 141--150.

Digital Library

[21]

Bogdan C. Popescu, Bruno Crispo, and Andrew S. Tanenbaum. 2006. Safe and private data sharing with turtle: Friends team-up and beat the system. In Proceedings of the 12th International Workshop Security Protocols. Springer.

Digital Library

[22]

Stefanie Roos and Thorsten Strufe. 2012. Provable polylog routing for darknets. In Proceedings of the 4th Workshop on Hot Topics in Peer-to-Peer Computing and Online Social Networking (HotPOST’12).

Digital Library

[23]

Stefanie Roos and Thorsten Strufe. 2013. A contribution to darknet routing. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM’13).

[24]

Stefanie Roos and Thorsten Strufe. 2015. On the impossibility of efficient self-stabilization in virtual overlays with churn. In INFOCOM. IEEE.

[25]

Benjamin Schiller, Stefanie Roos, Andreas Höfer, and Thorsten Strufe. 2011. Attack resistant network embeddings for darknets. In Proceedings of the 30th Symposium on Reliable Distributed Systems Workshops (SRDSW’11).

Digital Library

[26]

Guanyu Tian, Zhenhai Duan, Todd Baumeister, and Yingfei Dong. 2014. Reroute on loop in anonymous peer-to-peer content sharing networks. In Proceedings of the 2014 IEEE Conference on Communications and Network Security (CNS’14). IEEE, 409--417.

[27]

Eugene Vasserman, Rob Jansen, James Tyra, Nicholas Hopper, and Yongdae Kim. 2009. Membership-concealing overlay networks. In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS’09).

Digital Library

Cited By

Tazi FShrestha SDe La Cruz JDas S(2022)SoK: An Evaluation of the Secure End User Experience on the Dark Net through Systematic Literature ReviewJournal of Cybersecurity and Privacy10.3390/jcp20200182:2(329-357)Online publication date: 27-May-2022
https://doi.org/10.3390/jcp2020018

Index Terms

Dealing with Dead Ends: Efficient Routing in Darknets

Recommendations

Greedy Embedding, Routing and Content Addressing for Darknets
NETSYS '13: Proceedings of the 2013 Conference on Networked Systems

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 ...
A P2P Overlay Network Routing Algorithm Based on Group-Average Agglomerative Clustering Topology
HIS '09: Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 02

The use of peer-to-peer (p2p) applications is growing dramatically. Most p2p applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get ...
A P2P Overlay Network Routing Algorithm Based on Hierarchy Agglomerative Clustering Topology
ICGEC '10: Proceedings of the 2010 Fourth International Conference on Genetic and Evolutionary Computing

Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing efficiency, a new routing algorithm named RHAC based on ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Modeling and Performance Evaluation of Computing Systems

ACM Transactions on Modeling and Performance Evaluation of Computing Systems Volume 1, Issue 1

Inaugural Issue

March 2016

118 pages

ISSN:2376-3639

EISSN:2376-3647

DOI:10.1145/2893449

Editors:
Don Towsley
University of Massachusetts—Amherst, USA
,
Carey Williamson
University of Calgary, Canada

Issue’s Table of Contents

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 February 2016

Accepted: 01 July 2015

Revised: 01 May 2015

Received: 01 October 2014

Published in TOMPECS Volume 1, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Deutsche Forschungsgemeinschaft (DFG)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
282
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tazi FShrestha SDe La Cruz JDas S(2022)SoK: An Evaluation of the Secure End User Experience on the Dark Net through Systematic Literature ReviewJournal of Cybersecurity and Privacy10.3390/jcp20200182:2(329-357)Online publication date: 27-May-2022
https://doi.org/10.3390/jcp2020018

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents