Главная
Study mode:
on
1
Introduction
2
Overview of Peer to peer met works
3
The Small World Phenomenon
4
Navigable Small World Net- works
5
Light P2P Networks
6
Dark or Friend to Friend P2P Networks
7
Kleinberg's Result
8
Kleinbergs Result, cont.
9
Application, cont.
10
The Method, cont.
11
The Algorithm, cont.
12
Simulations, cont.
13
Results, cont.
14
Practical Concerns
15
Preventing Malicious Behaviour
16
Ensuring ease of use
17
Storing Data
18
Conclusion, cont.
Description:
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.

Routing in the Dark - Scalable Searches in Dark P2P Networks

Black Hat
Add to list