Improved Anonymous Communication Protocol Based on Crowds

Abstract

Abstract: The Crowds system is effective and practical, however there are two deficiencies: intermediate nodes can know receivers’ identities and there is no upper bound for the route length. To address the deficiencies mentioned above, an improved anonymous communication protocol is proposed. The new protocol is based on Crowds, while it is added with more designs of Pseudo receiver and Max-Min route length. Pseudo receivers’ addresses substitutes as receivers’ in packets to prevent intermediate nodes getting receivers’ identities; Users can decide max and min route length to limit the route length and meet the anonymity demand. By comparing the related data calculated under the same expected value for the route length, it is concluded that the new protocol effectively improves the degree of anonymity for users. At the same time, the new protocol is simulated and validated.

Key words: anonymous communication, pseudo receiver, max-min route length, Crowds

CLC Number:

TP393

He Gaofeng, Chen Lu, Zhang Tao, Ma Yuanyuan. Improved Anonymous Communication Protocol Based on Crowds[J]. Journal of System Simulation, 2015, 27(12): 3050-3056.

References

[1] David Chaum.Untraceable electronic mail, return addresses, and digital pseudonyms[J]. Communication of the ACM (S0001-0782), 1981, 24(2): 84-88.
[2] Dingledine R, Mathewson N, Syverson P. Tor: The second-generation onion router, Proc of 13th USENIX Security Symposium, San Diego, CA, USA, 2004. [C/OL]. (2004-05-18) [2014-9-13]. http://tor.eff.org/tor- design.pdf.
[3] Berthold O, Federrath H, Kopsell S.Web MIXes: A system for anonymous and unobservable Internet access[C]// Proc of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, LNCS 2009. Germany: Springer-Verlag, 2000: 115-129.
[4] Danezis G, Dingledine R, Mathewson N.Mixminion: Design of a type III anonymous remailer protocol[C]// Proc of the 2003 IEEE Symposium on Security and Privacy. USA: IEEE, May 2003: 2-15.
[5] Rao S, Priya D D.Cooperative Caching in Wireless P2P Networks: Design, Implementation and Evaluation[J]. International Journal of Research in Computer and Communication Technology (S2248-9622), 2013, 2(10): 915-919.
[6] Jia J, Zhang F.Twice Anonymity Algorithm for LBS in Mobile P2P Environment[J]. Journal of Computational Information Systems, 2013, 9(9): 3715-3722.
[7] Sabra Z, Artail H.Preserving anonymity and quality of service for VoIP applications over hybrid networks[C]// 2014 17th IEEE Mediterranean Electrotechnical Conference (MELECON). USA: IEEE, 2014: 421-425.
[8] Reiter M K, Rubin A D.Crowds: Anonymity for web transactions[J]. ACM Transaction on Information and System Security (S1094-9224), 1998, 1(1): 66-92.
[9] Herrmann M, Grothoff C.Privacy-implications of performance-based peer selection by onion-routers: a real-world case study using I2P[C]// Privacy Enhancing Technologies. Germany: Springer Berlin Heidelberg, 2011: 155-174.
[10] Dong K, Gu T, Tao X, et al. JointCache: Collaborative path confusion through lightweight P2P communication[C]// 2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops). USA: IEEE, 2013: 352-355.
[11] Memon I, Domenic K, Memon H, et al. Rumor Riding: An anonymity approach for decentralized peer to peer systems[J]. Wireless Personal Communications (S0929-6212), 2014, 79(1): 647-660.
[12] 睦红飞, 陈松乔, 陈建二. Crowds系统中基于递减转发概率的路长控制策略[J]. 小型微型计算机系统, 2005, 26(3): 557-391.
[13] 王伟平, 陈建二, 王建新, 等. 基于群组的有限路长匿名通信协议[J]. 计算机研究与发展, 2003, 40(4): 609-614.
[14] Xu J, Wang Z X, Zhang L C, et al. Recipient anonymity: An improved Crowds protocol based on key sharing[C]// Proc of WASE International Conference on Information Engineering, Beidaihe, China. USA: IEEE, 2010: 60-64.
[15] Jelasity M, Montresor A, Jesi G P, et al. PeerSim: A Peer-to-Peer Simulator [EB/OL]. (2014-05-29) [2014-09-13]. http://peersim.sourceforge.net, 2014.