Blind Rendezvous Distributed Hash Table for Anonymous Peer Discovery

Anonymous Peer Discovery in Peer-to-Peer Networks and Distributed Systems is still a challenging problem because existing Distributed Hash Tables (DHTs) inherently reveal both the routing and the metadata of participation. This work presents Blind Rendezvous DHT (BR-DHT), a decentralized overlay that achieves query and publisher anonymity through rendezvous points that are cryptographically blinded. and embedded in the DHT Key space. Instead of direct Lookups, peers publish ephemeral rendezvous tokens, and queries are executed via multi-hop paths that conceal both the initiator and the responders' from intermediate nodes. BR-DHT integrates private information retrieval techniques with onion-style message wrapping to prevent linkage between storage and retrieval events while maintaining scalable DHT performance. This approach extends the privacy guarantees of existing anonymous communication systems to fully decentralized peer discovery