Network flow watermarking attack on low-latency anonymous communication systems

被引:108
作者
Wang, Xinyuan [1 ]
Chen, Shiping [3 ]
Jajodia, Sushil [2 ]
机构
[1] George Mason Univ, Dept ISE, Fairfax, VA 22030 USA
[2] George Mason Univ, CSIS, Fairfax, VA 22030 USA
[3] Sybase Inc, Sybase Dr, Dublin, CA 94568 USA
来源
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS | 2007年
关键词
D O I
10.1109/SP.2007.30
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many proposed low-latency anonymous communication systems have used various flow transformations such as traffic padding, adding cover traffic (or bogus packets), packet dropping, flow mixing, flow splitting, and flow merging to achieve anonymity It has long been believed that these flow transformations would. effectively disguise network flows, thus achieve good anonymity In this paper, we investigate the fundamental limitations of flow transformations in achieving anonymity, and we show that flow transformations do not necessarily provide the level of anonymity people have expected or believed. By injecting unique watermark into the inter-packet timing domain of a packet flow, we are able to make an), sufficiently long flow uniquely identifiable even if 1) it is disguised by substantial amount of cover traffic, 2) it is mixed or merged with a number of other flows, 3) it is split into a number subflows, 4) there is a substantial portion of packets dropped, and 5) it is perturbed in timing due to either natural network delay jitter or deliberate timing perturbation. In addition to demonstrating the theoretical limitations of low-latency anonymous communications systems, we develop the first practical attack on the leading commercial low-latency anonymous communication system. Our real-time experiments show that our flow watermarking attack only needs about 10 minutes active Web browsing traffic to "penetrate" the Total Net Shield service provided by www.anonymizer.com. Our analytical and empirical results demonstrate that achieving anonymity in low-latency communication systems is much harder than we have realized, and current flow transformation based low-latency anonymous communication systems need to be revisited.
引用
收藏
页码:116 / +
页数:3
相关论文
共 31 条
[1]  
[Anonymous], P ACM CCS 00
[2]  
BERTHOLD O, 2000, LNCS, V2009, P115, DOI DOI 10.1007/3-540-44702-4.7
[3]  
BERTHOLD O, 2000, P COMP FREED PRIV AP
[4]  
BLUM A, 2004, P 7 INT S REC ADV IN
[5]  
CHAUM D, 1981, COMMUNICATIONS ACM, V4
[6]  
CHAUM D, 1988, J CRYPTOGRAPHY, V1
[7]  
DANZIG PB, 1991, USCCS91495 U SO CALI
[8]  
DINGLEDINE D, 2000, P 13 USENIX SEC S AU
[9]  
Donoho DL, 2002, LECT NOTES COMPUT SC, V2516, P17
[10]  
Felten E. W., 2000, P ACM C COMP COMM SE, DOI [10.1145/352600.352606, DOI 10.1145/352600.352606]