TY - GEN
T1 - Group routing
T2 - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
AU - Tang, Peng
AU - Gao, Qingyi
PY - 2009
Y1 - 2009
N2 - 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 pre-constructed 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.
AB - 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 pre-constructed 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.
UR - https://www.scopus.com/pages/publications/77949683775
U2 - 10.1109/CISE.2009.5363125
DO - 10.1109/CISE.2009.5363125
M3 - 会议稿件
AN - SCOPUS:77949683775
SN - 9781424445073
T3 - Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
BT - Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
Y2 - 11 December 2009 through 13 December 2009
ER -