期刊文献+

包间隔流关联技术中的同步问题研究 被引量:3

Synchronization in Inter-Packet Delay Based Flow Correlation Techniques
下载PDF
导出
摘要 包间隔(inter-packetdelay,IPD)是流关联技术中应用最为广泛的流特征之一,通过在输出流中选取合适的报文样本,计算其基于IPD的统计特征值,并利用关联算法计算与输入流之间的相似性.然而,在传输过程中网络上的各种干扰会破坏流之间的同步性,导致关联起始时间、包间隔等对应关系的错位,严重影响流关联技术的检测率.详细分析了对流的各种干扰,提出基于匹配集的同步思想,为输入流中的每个关联点在输出流中指定若干可能的映射.以贪心法和递进法为基本思路分别提出了同步算法,可以有效提高流同步技术的效果.实验结果表明,该方法能够解决存在干扰的情况下的流同步问题,对提高流关联技术的检测率具有显著效果. As one of the most important network flow characteristics, Inter-packet delay (IPD) is used by lots of flow correlation techniques. It selects appropriate packet samples in the output flow to calculate the statistical characteristics based on IPDs, and estimates the similarity to the input flow's characteristics using correlation algorithms. However, perturbations during flow transmission will destroy the synchronization among flows and mismatch the correlation start point and IPDs, which significantly decreases the detection rate. All types of perturbations are summarized in this paper and a new matching-set based synchronization idea is introduced, which assigns several possible mappings for each correlation point. Two synchronization algorithms based on greedy and progressive methods are proposed to improve the effect of flow correlation techniques. The experimental result shows that the proposal in this paper can effectively solve the synchronization problem in the case of flow perturbation and increase the detection rate of IPD based flow correlation techniques.
出处 《计算机研究与发展》 EI CSCD 北大核心 2011年第9期1643-1651,共9页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60903161 60903162 90912002) 国家"九七三"重点基础研究发展计划基金项目(2010CB328104) 国家科技支撑计划课题(2010BAI88B03) 国家科技重大专项(2009ZX03004-004-04) 高等学校博士学科点专项科研基金项目(200802860031) 江苏省自然科学基金项目(BK2008030) "信息安全"国家重点实验室(中国科学院研究生院)开放课题 江苏省"网络与信息安全"重点实验室(BM2003201) "计算机网络和信息集成"教育部重点实验室(93K-9)
关键词 流关联 包间隔 匹配集 最佳匹配 同步算法 flow correlation inter-packet delay~ matching set best matching synchronization algorithms
  • 相关文献

参考文献15

  • 1Chen S, Heberlein L. Holding intruders accountable on the internet [C] //Proc of the IEEE Syrup on Security and Privacy (S&P). Piscataway, NJ: IEEE, 1995:39-49.
  • 2Yoda K, Etoh H. Finding a connection chain for tracing intruders [C] //Proc of the 6th European Syrup on Research in Computer Security (ESORICS), Berlin: Springer, 2000: 191-205.
  • 3Chaum D. Untraceable electronic mail, return addresses, and digital pseudonyms [J]. Communications of the ACM, 1981, 24(2) : 84-88.
  • 4吴艳辉,王伟平,陈建二.匿名通信研究综述[J].小型微型计算机系统,2007,28(4):583-588. 被引量:15
  • 5Dingledine R, Mathewson N, Syverson P. Tor: The second- generation onion router [OL]. E2010-04-123. https://svn. torproject.org/svn[projects/design-paper/tor-design, html.
  • 6Wang X, Reeves D, Wu S. Inter-packet delay based correlation for tracing encrypted connections through stepping stones [C] //Proc of the 8th European Symp on Research in Computer Security ( ESORICS ). Berlin: Springer, 2002: 244-263.
  • 7Wang X, Reeves D. Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays [C]//Proc of the 10th ACM Conf on Computer and Communications Security (CCS). New York: ACM, 2003: 20-29.
  • 8Wang X, Reeves D, Ning P, et al. Robust network-based attack attribution through probabilistic watermarking of packet flows[R]. Raleigh, NC: Department of Computer Science, North Carolina State University, 2005.
  • 9Wang X, Chen S, Jajodia S. Tracking anonymous peer-to- peer VoIP calls on the internet [C]//Proc of the 12th ACM Conf on Computer and Communications Security (CCS). New York, ACM, 2005:81-91.
  • 10Houmansadr A, Kiyavash N, Borisov N. Rainbow: A robust and invisible non-blind watermark for network flows [OL]. [2010-04-12]. https://www.isoe.org/isoc/conferenees/ndss/09/pdf/13. pdf.

二级参考文献3

共引文献14

同被引文献12

引证文献3

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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