DEFCON 13: Routing in the Dark: Scalable Searches in Dark P2P Networks

Speakers:
Ian Clarke, Project Coordinator, FreenetProject Inc.
Oskar Sandberg, Department of Mathematical Sciences, Chalmers Technical University, Sweden

With peer to peer networks under fire by organizations using the legal system to attack participants, it seems that the only sustainable future is for dark, encrypted, networks where participants only talk to peers that they know and trust. Such networks, like WASTE, already exist to some extent, but they scale poorly and do not allow global communication.

This does not need to be the case, however. The "small world" observations, going back to Milgram's famous experiments in the sixties, show that social networks have all the right characteristics for being easy and efficient to navigate and search. It stands to reason that, under the right circumstances, so should a Darknet. We present algorithms for making routing possible in such networks, based on the real mathematics of how small worlds function. The goal is to build peer to peer networks that are difficult for outsiders to detect and infiltrate, making the job of those who wish to shut them down much harder.

For more information visit: http://bit.ly/defcon13_information
To download the video visit: http://bit.ly/defcon13_videos

Category:

Science & Technology

Tags:

• networks
• peer
• mathematics