一种改进的Crowds匿名通信协议

系统仿真学报 ›› 2015, Vol. 27 ›› Issue (12): 3050-3056.

• 信息、控制、决策与仿真 • 上一篇下一篇

一种改进的Crowds匿名通信协议

何高峰, 陈璐, 张涛, 马媛媛

国网智能电网研究院,江苏南京 210009

收稿日期:2014-10-28 修回日期:2014-12-02 出版日期:2015-12-08 发布日期:2020-07-30
作者简介:何高峰(1984-),男,安徽安庆,博士,工程师,研究方向为网络安全、机器学习;陈璐(1984-),女,江苏丹阳,硕士,工程师,研究方向为信息安全及网络安全。
基金资助:
国家电网公司科技项目(EPRIXXKJ[2014] 2244)

Improved Anonymous Communication Protocol Based on Crowds

He Gaofeng, Chen Lu, Zhang Tao, Ma Yuanyuan

China Electric Power Research Institute, Nanjing 210009, China

Received:2014-10-28 Revised:2014-12-02 Online:2015-12-08 Published:2020-07-30

摘要/Abstract

摘要： Crowds匿名通信系统高效、实用,但存在两个不足之处：中间节点能够知道接收者身份信息且转发路径长度随机。针对上述不足之处,提出了一种改进的匿名通信协议。新协议在Crowds基础上增加了伪接收者和最长最短转发路径。报文中用伪接收者地址代替接收者地址以阻止中间节点获得接收者身份信息;用户设定报文转发路径长度最大最小值实现转发路径长度有界性和满足一定匿名需求。相关分析结果表明,在相同转发路径长度期望值下,新协议能有效增加用户匿名度。同时,对新协议进行了仿真验证。

关键词: 匿名通信, 伪接收者, 最长最短转发路径, Crowds

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

中图分类号:

TP393

何高峰, 陈璐, 张涛, 马媛媛. 一种改进的Crowds匿名通信协议[J]. 系统仿真学报, 2015, 27(12): 3050-3056.

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.

参考文献

[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.

一种改进的Crowds匿名通信协议

Improved Anonymous Communication Protocol Based on Crowds

PDF (PC)

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	许斌, 闫文卿, 韩卓凡, 何广深, 邓涛, 赵云凯, 亓晋. 基于烟花算法的基站群协作计算卸载模型研究[J]. 系统仿真学报, 2022, 34(2): 354-365.
[2]	华翔, 石成泷, 李宝华, 张杰韬, 左嘉娴. 一种自适应的无人集群中心节点选择方法[J]. 系统仿真学报, 2021, 33(11): 2636-2646.
[3]	华翔, 李宝华, 姚红娟, 王昭, 左嘉娴. 一种动态感知的连通恢复方法研究[J]. 系统仿真学报, 2021, 33(7): 1514-1525.
[4]	林硕, 安磊, 高治军, 单丹, 尚文利. 结合栈式自编码及长短时记忆的入侵检测研究[J]. 系统仿真学报, 2021, 33(6): 1288-1296.
[5]	王振东, 谢华茂, 胡中栋, 李大海, 王俊岭. 改进花朵授粉算法的无线传感器网络部署优化[J]. 系统仿真学报, 2021, 33(3): 645-656.
[6]	董书琴, 张斌. 面向不平衡数据的网络流量异常检测方法[J]. 系统仿真学报, 2021, 33(3): 679-689.
[7]	陈帅. 基于多层耦合网络的舆情传播控制研究[J]. 系统仿真学报, 2020, 32(12): 2353-2361.
[8]	刘小虎, 张恒巍, 张玉臣, 马壮, 吕文雷. 基于博弈模型与NetLogo仿真的网络攻防态势研究[J]. 系统仿真学报, 2020, 32(10): 1918-1926.
[9]	华翔, 姚红娟, 王海, 王昭, 张杰韬, 舒力力. 自适应的无线融断网络路由算法研究[J]. 系统仿真学报, 2020, 32(10): 2022-2033.
[10]	王晓锋, 陈阳, 张光杰, 陈建宇. 面向网络仿真拓扑的多目标优化映射方法[J]. 系统仿真学报, 2020, 32(8): 1436-1445.
[11]	孙子文, 张炎棋, 徐宜敏. 一种采用混合抗干扰方法的路由恢复机制[J]. 系统仿真学报, 2020, 32(5): 874-884.
[12]	刘渊, 冯兴兵, 王晓锋, 邓赵红. 面向虚实互联网络的链路采集技术研究[J]. 系统仿真学报, 2020, 32(3): 421-429.
[13]	华翔, 梁洪涛, 董兆鑫, 王昭, 姚红娟, 李宝华, 姜冰清. 复杂水系无线监测网络的智能分簇算法研究[J]. 系统仿真学报, 2019, 31(11): 2255-2263.
[14]	张会丽, 李志河. 一种基于HNN的云服务组合优化[J]. 系统仿真学报, 2019, 31(11): 2335-2343.
[15]	刘渊, 邱常伶, 王晓锋, 蒋敏. 面向多尺度融合网络仿真的拓扑映射方法研究[J]. 系统仿真学报, 2019, 31(10): 2030-2041.