Improving Kademlia Lookup Privacy through Query Obfuscation


연구 분야: Analysis



학회: SAC '25: Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing


초록

This paper addresses privacy challenges inherent in Distributed Hash Tables (DHTs). While DHTs facilitate efficient content lookup, privacy concerns arise due to query mechanisms revealing user interests. In the paper, we focus on Kademlia-based DHTs and propose to obfuscate the lookup item by presenting three obfuscation methods: double hashing, Private Set Intersection, and prefix fetching. Based on our privacy improvements, we present a protocol specification for the libp2p kad-dht, a popular Kademlia implementation. The methods are analyzed in the context of measurement values derived from the public IPFS network, which uses kad-dht.


Author Profile
Erik Daniel

Technische Universität Dresden Dresden Saxony Germany

Germany
Author Profile
Guillaume Michel

Interplanetary Shipyard Zug Zug Switzerland

Switzerland
Author Profile
Florian Tschorsch

Technische Universität Dresden Dresden Saxony Germany

Germany

📄 논문 정보

발행 연도 2025년
인용수 0
출판 국가 Germany, Switzerland
사이트 ACM
좋아요 수 0

연관 논문 목록 (6건)