期刊文献+

匿名通信中短距离优先分组重路由方法的研究 被引量:17

Research on a Short Distance-Prior Rerouting Scheme in Anonymous Communication
下载PDF
导出
摘要 重路由技术是匿名通信系统中采用的主要技术手段之一.目前典型的匿名系统中大多采用随机重路由的策略,即在所有中转代理中随机选择一个进行转发的策略,随机转发策略要求每个中转代理知道系统中所有其他代理.随着系统的扩大,一方面中转代理数增加使得系统维护代价增加,另一方面由于部分中转代理之间距离很远,重路由带来的延迟增加.提出了一种新的重路由策略——距离优先分组重路由,实现了短距离优先转发的策略,重路由时在近距离分组中进行随机转发.分别将距离优先分组策略应用在随机概率转发和有限路长限制的重路由算法中,数学分析和模拟测试结果表明,新的重路由策略在一定分组成员数情况下能保持与非分组重路由算法相当的匿名性能,同时明显地降低了服务延迟.新的策略中每个中转代理只需知道就近分组中的代理,这为匿名系统的扩展性研究提供了一定的基础. Rerouting is one of the main schemes used in anonymous communication systems. In some typical anonymous communication systems, data packets pass through a numbers of proxies, and then to the end receiver. So the real initiator could be concealed. However, most rerouting schemes used in some prototype systems are random schemes, which choose the forward proxy randomly among all the proxies in a system. Random rerouting scheme requires every proxy to know some information of all the proxies in the system. With systems expanding, the number of proxies in the system increases, which makes the cost for management higher. Furthermore, its expanding will increase the delay of rerouting as the distance between some of the proxies increases. The paper proposes a new rerouting scheme-short distance-prior rerouting, which implements short distance-prior forwarding, and every proxy chooses a forwarder in its nearby group. The new scheme is applied in the random probability forward rerouting and definite path length rerouting algorithms. Mathematic analysis and simulation results indicate that the new scheme can keep almost the same anonymity as the typical ones and can obviously decrease the delay of forwarding. In the new scheme, each proxy only needs to know the information of proxies in its nearby group, which also gives some support to the research of scalability of anonymous systems.
出处 《软件学报》 EI CSCD 北大核心 2004年第4期561-570,共10页 Journal of Software
基金 国家自然科学基金~~
关键词 重路由 匿名通信 短距离优先 服务延迟 可扩展性 Computer simulation Data communication systems Packet switching Performance Quality of service
  • 相关文献

参考文献1

二级参考文献9

  • 1[1]D Chaum. Untraceable eletronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 1981, 24(2): 84~88
  • 2[2]Justin Boyan. The anonymizer. http://www.december.com/cmc/mag/1997/sep/boyan.html
  • 3[3]G Eran et al. Lucent personal web assistant. http://www.bell-labs.com /projects/lpwa
  • 4[4]D Goldschlag, M Reed, P Syverson. Onion routing for anonymous and private Internet connections. Communications of the ACM, 1999, 42(2): 39~41
  • 5[5]M Reed, P Syverson, D Goldschlag. Anonymous connection and onion routing. IEEE Journal on Selected Areas in Communications, 1998, 16(4): 482~492
  • 6[6]Zero-Knowledge Systems Inc. The Freedom Network. http://www.freedom.net
  • 7[7]O Berthold, H Federrath, S Kpsell. Web MIXes: A system for anonymous and unobservable Internet access. The Workshop on Design Issues in Anonymity and Unobservability, ICSI, Berkeley, 2000
  • 8[8]O Berthold, H Federrath, M Khntopp. Anonymity and unobservability in the Internet. The Workshop on Freedom and Privacy by Design/Conf on Computers, Freedom and Privacy, Toronto, Canada, 2000
  • 9[9]M K Reiter, A D Rubin. Crowds: Anonymity for web transactions. ACM Trans on Information and System Security, 1998, 1(1): 62~92

共引文献19

同被引文献121

引证文献17

二级引证文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部