Non Path-Based Mutual Anonymity Protocol for Decentralized P2P System
J. Chozhamadevi, S. Mohanarangan, D. Sivakumar · 2013
Each and every end-to-end systems try to mask the information and details of their users for privacy considerations. Existing quality of being anonymous approaches are mainly path-based: peers have to pre- construct an anonymous path before transmissio of any files and queries.The overhead of maintaining and updating such paths is significantly high also introduce high cost. Its called as blindly assigned path. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. Accelerating the query speed. Introducing mimic traffic to confuse attackers. Mimic traffic generates duplicate cipher and key rumor to confuse the attackers. This mimic traffic generates traffic in a purposefully irregular manner. Mimic is undetectable by any known detection technique at without loss of throughput. Index Terms: Mutual anonymity, non-path-based, random walk, peer-to-peer.