Advanced Privacy Preservation: A DHT- Pervaded Rumor Riding Protocol for Anonymous Communication

This study presents a file searching method called DHT-RR (Distributed Hash Table with Rumor Riding), which was developed to solve the issues of maximizing data propagation while preserving sender and recipient anonymity. The suggested DHT-RR overlay offers a strong basis for dependable and effective message distribution in search operations by smoothly integrating both unstructured and structured overlays based on ring topologies. When compared to the conventional random walk method in the RR (Rumor Riding) protocol, this special hybrid overlay structure improves scalability and operating efficiency, especially when used with flooding tactics. DHT-RR provides a more efficient and successful solution than the latter, which has problems such network congestion, redundant transmissions, scalability limitations, and poor Quality of Service. Additionally, compared to Gnutella-like searching protocols, DHT-RR performs better in finding unusual files. By addressing the shortcomings of current RR protocols, the protocol's novel methodology makes it a viable option for safe, scalable, and effective file searching in distributed contexts.