一种高效的随机混淆匿名算法.PDFVIP

第 25 卷第 5 期 计 算 机 应 用 研 究 Vol. 25 No. 5 2008 年 5 月 Application Research of Computers May 2008 一种高效的随机混淆匿名算法 * 1 2 张 林 , 吴振强 ( 1. 商洛学院 计算机科学系, 陕西 商洛 726000; 2. 陕西师范大学 计算机学院, 西安 710062) 摘 要: 现有的混淆算法都无法适应高速网络的匿名需求, 为此提出了一种随机数混淆 ( RM) 算法。RM 算法 在网络低流量下采用时延转发方式 , 在高流量时采用随机数转发方式。这样既保证了匿名系统的匿名性 , 同时 又解决了 SGM 算法中的溢出问题。对 RM 算法的安全性和效率进行了分析 , 仿真结果与理论分析相一致, 表明 RM 算法在开放式高速网络下有较好的自适应性和实用价值。 关键词: 匿名算法; 高速网络; 随机数混淆; 消息缓冲 中图分类号: TP309; TP393. 08 文献标志码: A 文章编号: 1001- 3695( 2008) 05- 1345- 04 Efficient anonymity algorithm based on random mix 1 2 ZHANG Lin , WU Zhen-qiang ( 1. Dept. of Computer Science, Shangluo University, Shangluo Shaanxi 726000, China; 2. College of Computer Science, Shaanxi Normal Uni- versity, Xi ’an 710062, China) Abstract: Existed mixed algorithms do not apply to the high speed networks in open environments. This paper presented a random mix( RM) based anonymity algorithm for the high-speed networks. The algorithm delayed a message by time stamps when the networks traffic flow was low, and forwarded message randomly when the networks traffic flow was high. The RMal- gorithm not only guaranteed the anonymity of an anonymous communication system, but also solved the overflow problem in SGM algorithm. The analysis shows that the RM algorithm has desirable security property and it can evidently improve the effi- ciency of an anonymous system. The simulation make known that the RM algorithm is better than