[1]杨明,张怡婷,罗军舟.基于随机带宽加权的匿名通信节点选择算法[J].东南大学学报(自然科学版),2010,40(6):1169-1173.[doi:10.3969/j.issn.1001-0505.2010.06.008]
 Yang Ming,Zhang Yiting,Luo Junzhou.Randomized bandwidth-weighted node selection algorithm for anonymous communication[J].Journal of Southeast University (Natural Science Edition),2010,40(6):1169-1173.[doi:10.3969/j.issn.1001-0505.2010.06.008]
点击复制

基于随机带宽加权的匿名通信节点选择算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
40
期数:
2010年第6期
页码:
1169-1173
栏目:
计算机科学与工程
出版日期:
2010-11-20

文章信息/Info

Title:
Randomized bandwidth-weighted node selection algorithm for anonymous communication
作者:
杨明1 张怡婷2 罗军舟1
1 东南大学计算机科学与工程学院, 南京 210096; 2 南京邮电大学计算机学院, 南京 210003
Author(s):
Yang Ming1 Zhang Yiting2 Luo Junzhou1
1 School of Computer Science and Engineering, Southeast University, Nanjing 210096,China
2 School of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
关键词:
匿名通信 节点选择算法 性能 匿名度
Keywords:
anonymous communication node selection algorithm performance anonymity degree
分类号:
U459.2
DOI:
10.3969/j.issn.1001-0505.2010.06.008
摘要:
为了提高匿名通信系统的安全性, 并在性能和匿名度之间取得更好的折中, 建立了一种以用户平均可用带宽为性能指标、以攻击者同时占据链路出/入口概率为安全性指标的匿名通信系统评估方法, 并在此基础上提出了一种新的基于随机带宽加权的匿名通信节点选择算法. 该算法将匿名通信节点按带宽排序并分组, 在节点组之间采用带宽加权选择方式, 在组内则采取等概率随机节点选择策略,并通过在节点选择过程中引入随机因素来提高系统的安全性. 针对Tor在线节点真实数据的实验测试结果表明, 当选择合适的组内节点数时, 可通过小幅降低系统性能为代价, 取得更好的系统安全性. 该算法为用户动态调节系统性能和安全性提供了有效途径.
Abstract:
In order to improve the security of anonymous communication systems and achieve a better balance between performance and anonymity, a new evaluation approach is introduced in which the mean user available bandwidth is taken as the performance metric and the probability that an attacker occupies both the exit and entry nodes of a communication path simultaneously is adopted as the security metric. Furthermore, a new randomized bandwidth-weighted node selection algorithm is proposed according to the two metrics. All the anonymous communication nodes are first sorted and divided into different groups according to their bandwidths. And then the bandwidth-weighted selection is performed between node groups, whereas the nodes in the same group are selected with equal probability. The security of the anonymous communication systems are improved by introducing randomness to the node selections. The experiments on the real-world Tor nodes data are conducted and the results show that the higher security of the anonymous communication systems can be achieved at the cost of a little decrease of performance when the appropriate group size is chosen. The algorithm provides an effective way for users to tune up systems dynamically between security and performance.

参考文献/References:

[1] Chaum D.Untraceable electronic mail,return addresses and digital pseudonyms[J].Communications of the ACM,1981,24(2):84-88.
[2] Dingledine R,Mathewson N,Syverson P.Tor:the second-generation onion router[C] //Proceedings of the 13th Conference on USENIX Security Symposium.San Diego,CA,USA,2004:19-21.
[3] Snader R,Borisov N.A tune-up for Tor:improving security and performance in the Tor network[C] //Proceedings of the 15th Annual Network & Distributed System Security Symposium.San Diego,CA,USA,2008:1-10.
[4] Zhu Y,Fu X,Graham S,et al.On flow correlation attacks and countermeasures in mix networks[C] //Proceedings of Privacy Enhancing Technologies Workshop(PET’04).Toronto,CA,USA,2004:207-225.
[5] Wang X,Chen S,Jajodia S.Network flow watermarking attack on low-latency anonymous communication systems[C] //Proceedings of IEEE Security and Privacy Symposium(S& P’07).Oakland,CA,USA,2007:116-130.
[6] Yu W,Fu X,Graham S,et al.DSSS-based flow marking technique for invisible traceback[C] //Proceedings of IEEE Symposium on Security and Privacy(S& P’07).Oakland,CA,USA,2007:18-32.
[7] Pries R,Yu W,Fu X,et al.A new replay attack against anonymous communication networks[C] //Proceedings of the IEEE International Conference on Communications(ICC’08).Beijing,China,2008:1578-1582.
[8] Ling Z,Luo J,Yu W,et al.A new cell counter based attack against Tor[C] //Proceedings of the 16th ACM Conference on Computer and Communications Security(CCS’09).Chicago,Illinois,USA,2009:578-589.
[9] Houmansadr A,Kiyavash N,Borisov N.RAINBOW:a robust and invisible non-blind watermark for network flows[C] //Proceedings of the 16th Annual Network & Distributed System Security Symposium.San Diego,California,USA,2009:1-13.
[10] Dingledine R,Mathewson N.Tor protocol specification [EB/OL].(2007-10-01)[2010-03-02].https://www.torproject.org.

备注/Memo

备注/Memo:
作者简介: 杨明(1979—), 男, 博士, 讲师, yangming2002@seu.edu.cn.
基金项目: 国家自然科学基金资助项目(60903161, 60903162, 90912002)、“十一五”国家科技支撑计划资助项目(2010BAI88B03)、教育部博士点基金资助项目(200802860031)、江苏省自然科学基金资助项目(BK2008030)、江苏省网络与信息安全重点实验室研究课题资助项目(BM2003-201)、网络与信息集成教育部重点实验室研究课题资助项目(93K-9).
引文格式: 杨明,张怡婷,罗军舟.基于随机带宽加权的匿名通信节点选择算法[J].东南大学学报:自然科学版,2010,40(6):1169-1173. [doi:10.3969/j.issn.1001-0505.2010.06.008]
更新日期/Last Update: 2010-11-20