Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
Makefile
README.md
privacy_preserving_dht.bib
privacy_preserving_dht.md
privacy_preserving_dht.pdf

README.md

Privacy Preserving Distributed Hash Tables - Reality and Future

Version

note: The current version of the paper is a draft and being review and modified. This is an open research work: feel free to contribute with ideas, corrections and content. This work is supported by hashmatter.

Abstract Distributed Hash Tables (DHT) are overlay networks that enable nodes to store and request data in a peer-to-peer (P2P) network. Data storage and data lookups are resolved collectively through a collaborative routing protocol, which makes storage location deterministic and data lookups possible. The collaborative nature of DHTs results on resilient, scalable and decentralized networks where nodes are not required to maintain a complete view of the network while, simultaneously, not relying on central authorities. These properties make DHTs an important building block for the decentralized web and P2P systems. However, the decentralized nature of DHTs introduces privacy vulnerabilities due to the metadata leaked during the routing and lookup protocols. In naïve DHT implementations, it is trivial for any adversary to gather information about which nodes are requesting what data and which nodes are providing what data, without being detected and with relative low resources. Nowadays, the decentralized web ecosystem is relying heavily on DHTs as networks such as IPFS and Dat are steadily reaching mainstream adoption. Thus, it is important to address privacy preserving vulnerabilities of DHTs. Failing to deliver on user privacy will render decentralized systems unattractive as a viable alternative to centralized systems. In this paper we review research on mechanisms and protocols to achieve privacy preserving DHTs, outline open problems and directions for future research.


The core of the paper is a literature review of research work on protocols and mechanisms for enhancing privacy in DHTs and its vulnerabilities. Currently, the literature section is organized as follow:

Privacy preserving DHTs: protocols and mechanisms

A. Privacy preserving DHT lookups

  • Octopus: A Secure and Anonymous DHT Lookup

  • Adding Query Privacy to Robust DHTs

  • Design of PriServ, a privacy service for DHTs

  • Information Leaks in Structured Peer-to-Peer Anonymous Communication Systems

  • In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems

  • Anonymous routing in structured peer-to-peer overlays (thesis)

  • Scalable Anonymous Communication with Provable Security

  • Route Fingerprinting in Anonymous Communications

B. DHTs in anonymous communication systems

  • Scalable Onion Routing with Torsk
  • Bifrost : A Novel Anonymous Communication System with DHT

C. Privacy mechanisms in P2P networks

  • HORNET: High-speed Onion Routing at the Network Layer
  • NISAN: Network Information Service for Anonymization Networks
  • ShadowWalker: Peer-to-peer Anonymous Communication Using Redundant Structured Topologies
  • TAP: A Novel Tunneling Approach for Anonymity in Structured P2P Systems

Privacy vulnerabilities of DHTs

  • Large-Scale Monitoring of DHT Traffic
  • Security Considerations for Peer-to-Peer Distributed Hash Tables
  • Hashing it out in public: common failure modes of DHT-based anonymity schemes
  • Routing in the Dark: Pitch Black
  • Information Leaks in Structured Peer-to-peer Anonymous Communication Systems
  • In Search of an Anonymous and Secure Lookup: Attacks on Structured Peer-to-peer Anonymous Communication Systems
  • Information leak in the Chord lookup protocol

The paper wraps up outlining future work and research directions.

Contribute

This is an open research work. Feel free to contribute with ideas, content, corrections or to fork it.

Edit and generate the PDF: The paper is written in Markdown (privacy_preserving_dht.md) and the Latex PDF file is generated using pandoc and bibtex (privacy_preserving_dht.bib). To generate the final PDF, use the Makefile steps.


MIT License

Copyright (c) [2018] [Goncalo Pestana - hashmatter]

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

You can’t perform that action at this time.