Utilizing the BitTorrent DHT for blind rendezvous and information exchange
Reese Moore, Christopher Morrell, Randy C. Marchany, Joseph G. Tront · 2015
This paper introduces a moving target blind rendezvous system leveraging the BitTorrent Distributed Hash Table (DHT) to securely locate other nodes in a distributed system and to exchange information without a single point of failure. We leverage cryptographic constructions such as Elliptic Curve Diffie-Hellman key exchange and secure hashing functions, as well as the immense size of the BitTorrent DHT swarm to build this secure system. We require a minimal amount of pre-shared information and additionally allow that pre-shared information to be publicly available in the form of public keys. Our goal in this work is to provide a means of secure information dissemination that improves the capability of privacy focused and censorship avoidance systems.