Routing in the Dark - Scalable Searches in Dark P2P Networks

Explore the intricacies of dark peer-to-peer networks in this Black Hat USA 2005 conference talk. Delve into the concepts of scalable searches, the small world phenomenon, and navigable small world networks. Learn about Kleinberg's result and its application to dark P2P networks. Discover the methods and algorithms used for routing in these networks, supported by simulation results. Address practical concerns such as preventing malicious behavior, ensuring ease of use, and data storage. Gain insights from speakers Ian Clarke and Oskar Sandberg as they discuss the challenges and solutions for routing in dark P2P networks, providing a comprehensive overview of this complex topic in network security.

Introduction
Overview of Peer to peer met works
The Small World Phenomenon
Navigable Small World Net- works
Light P2P Networks
Dark or Friend to Friend P2P Networks
Kleinberg's Result
Kleinbergs Result, cont.
Application, cont.
The Method, cont.
The Algorithm, cont.
Simulations, cont.
Results, cont.
Practical Concerns
Preventing Malicious Behaviour
Ensuring ease of use
Storing Data
Conclusion, cont.