期刊文献+

采用多流联合质心熵的网络流水印检测方法

Detecting Network Watermark Through Multi-flow Joint Entropy of Centroid
下载PDF
导出
摘要 随着跳板主机和匿名网络成为隐匿通信关系的常用手段,网络攻击流量的溯源和定位难度日益增大.网络流水印技术在网络隐私安全领域已逐渐成为了一种重要的网络流量追踪和定位手段,设计良好的网络流水印具有强大的鲁棒性和隐蔽性,使得对网络流水印的存在性检测变得异常困难,而对流水印实施有效检测是进一步实现水印移除或水印流量复制的前提.本文提出了一种基于多流联合质心熵的水印盲检测方法,其可以实现针对当前典型的时隙质心类流水印的有效检测.在实际SSH流量上的实验结果表明,所提方法在单密钥情形下可达到与当前普遍采用的多流攻击相近的检测效果,在随机多密钥情形下多流攻击方案失效而本文方案依然可以实现高效检测. stepping-stone host and anonymous network are commonly used to hide communication relationships in recent years,it is increasingly hard to trace and locate the source of the traffic. Network watermark has gradually been an important tool to trace and locate network flow in the area of network security and privacy. Well-designed network watermark can have a strong feature of robustness and invisibility,which makes it hard for effective existence detection,however,effective detection is the precondition of the further implementation of the watermark removal or the watermark flow replication. We proposed a new blind detection method based on multiflow joint entropy of centroid through taking both multi-flow correlation and transformation of centroid distribution into consideration which can accomplish the effective detection of centroid-based network watermark with random secret keys. Experimental results show that our approach has an equal efficiency compared with common used multi-flow attack method on real-world SSH flows when faced with watermark using same secret keys,moreover,in the case of random keys multi-flow attack scheme failed but our scheme can still achieve highly effective detection.
出处 《小型微型计算机系统》 CSCD 北大核心 2017年第11期2443-2447,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61472188 61602247)资助 江苏省自然科学基金项目(BK20150472 BK20160840)资助 国家科技支撑计划项目(2014BAH41B01)资助 中央高校基本科研业务费专项项目(30920140121006 30915012208)资助
关键词 流量溯源 流水印 匿名网络 跳板主机 多流攻击 flow tracing network watermark anonymous network stepping-stone host multi-flow attack
  • 相关文献

参考文献3

二级参考文献126

  • 1周昌令,钱群,赵伊秋,尚群.校园无线网用户群体的移动行为聚集分析[J].通信学报,2013,34(S2):111-116. 被引量:4
  • 2DINGLEDINE R, MATHEWSON N, SYVERSON P. Tor: the second-generation onion router [C]//Proceedings of the 13th USENIX Security Symposium, San Diego, 2004: 303-320.
  • 3REITER M K, RUBIN A D. Crowds: anonymity for web transactions [J]. ACM Transactions on Informa- tion and System Security, 1998, 1(1): 66-92.
  • 4REITER M K, RUBIN A D. Anonymous web transac- tions with crowds [J]. Communications of the ACM, 1999, 42(2): 32-38.
  • 5ZHANG Y, PAXSON V. Detecting stepping stones [C]//Proceedings of the 9th USENIX Security Sym- posium, Denver, Colorado, 2000: 171-184.
  • 6STANIFORD-CHEN S, HEBERLEIN L T. Holding in- truders accountable on the Internet [C]//Proceedings of the 1995 IEEE Symposium on Security and Pri- vacy, Oakland, 1995: 39-49.
  • 7WANG X Y, REEVES D S, WU S F. Inter-packet delay based correlation for tracing encrypted con- nections through stepping stones [C]//Proceedings of the 7th European Symposium on Research in Com- puter Security, Zurich, Switzerland, 2002: 244-263.
  • 8WANG X Y, REEVES D S. Robust correlation of en- crypted attack traffic through stepping stones by ma- nipulation of interpacket delays [C]//Proceedings of the 10th ACM Conference on Computer and Com- munications Securitv. Washinnn. NN.: N-0.
  • 9HE Ting, TONG Lang. Detecting encrypted stepping-stone connections [J]. IEEE Transactions on Signal Processing, 2007, 55(5): 1612-1623.
  • 10ZHU Y, Fu X W, GRAMHAM B, BETTATI R, ZHAO W. Correlation-based traffic analysis attacks on anonymity networks [Jl. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(7): 954- 967.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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