By Topic

Group Routing: a Reliable Mutual Anonymous Approach in Dynamic Overlay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Peng Tang ; Inst. of Adv. Comput. Technol., Beihang Univ., Beijing, China ; Qingyi Gao

As an important component of online privacy, anonymity is concerned by all users of P2P system. Many methods are proposed to provide mutual anonymity and most of them are path-based: an anonymous path should be constructed by source peer before transmission. Although those proposals perform well in providing mutual anonymity, the pre-constructed paths suffer from node churn and make anonymous transmission unreliable. In this paper, we propose Group Routing (GR), an approach which is based on Onion Routing, to provide reliability as well as mutual anonymity. In GR, every stage of the preconstructed path contains several nodes to be redundancies each others, and the messages are encrypted and split into several packages to be forward to destination in the path. Compared with previous approaches that focus on reliability of anonymous communication, GR takes advantage of higher reliability and anonymity. We demonstrate the effectiveness of GR through theoretical analysis and simulations. The analytical and experimental results show GR is more efficient to other proposals.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009