期刊文献+

基于Counting Bloom Filter的DNS异常检测 被引量:2

DNS anomaly detection based on Counting Bloom Filter
下载PDF
导出
摘要 鉴于失败的DNS查询(failed DNS query)能提供恶意网络活动的证据,以DNS查询失败的数据为切入口,提出一种轻量级的基于Counting Bloom Filter的DNS异常检测方法。该方法使用带语义特征的可逆哈希函数对被查询的域名及发起查询的IP进行快速的聚类和还原。实验结果证明该方法能以较少的空间占用和较快的计算速度有效识别出DNS流量中的异常,适用于僵尸网络、分布式拒绝服务(DDoS)攻击等异常检测的前期筛选和后期验证。 Considering that DNS query failure can serve as communication evidence for activities of malware, this paper provides a DNS anomaly detection method based on Counting Bloom Filter with failure data as its entry point. This method conducts clustering towards domain names queried and IP which initiates the query, using revertible hash function with semantic features. After the clustering, the few Top N hash strings will be worked backwards to get the dominating shorting strings, which will be spliced according to the results of homology judgment. Experimental results prove that this method can effectively identify the anomaly in DNS flow, thus can be applied to early screening and later validation of anomaly detections, such as botnet and DDoS attack.
出处 《计算机工程与应用》 CSCD 2014年第15期82-86,共5页 Computer Engineering and Applications
基金 国家重点基础研究发展规划(973)(No.2009CB320505) 江苏省科技支撑计划(No.BE2011173)
关键词 域名系统(DNS)查询失败 计数型布隆过滤器 异常检测 Domain Name System (DNS) query failure Counting Bloom Filter anomaly detection
  • 相关文献

参考文献6

二级参考文献44

  • 1Mockapetris P. RFC1034 Domain Names - Concepts and Facilitilies. 1987.
  • 2Mockapetris P. RFC1035 Domain Names implementation and specification. 1987.
  • 3维基百科.熵.http://zh.wikipedia.org/zh-cn/熵.
  • 4Shannon CE, A Mathematical Theory of Communi cation. The Bell System Technical Journal, 1948, 127:379 - 423,623 - 656.
  • 5维基百科.熵(信息论).http://zh.wikipedia.org/wiki/熵_(信息论).
  • 6Feinstein L, Schnackenberg D, Balupari R, Kindred D. Statistical Approaches to DDOS Attack Detection and Response. Proc. DARPA Information Survivability Conf. and Exposition, 2003, IEEE CS Press,303 - 314.
  • 7Postel J.Transmission control protocol,RFC793.Internet Society,1981.
  • 8Koloniari K,Pitoura E.Bloom filters for hierarchical data.In:Proc.of the 5th Int'l Workshop on Distributed Data and Structures (WDAS).2003.
  • 9Bernard C,Joe K,Ronitt R,Ayellet T.The bloomier filter:An efficient data structure for static support lookup tables.In:Proc.of the 15th Annual ACM-SIAM Symp.on Discrete Algorithms Table of Contents.Philadelphia:Society for Industrial and Applied Mathematics,2004.30-39.
  • 10Little MC,Speirs NA,Shrivastava SK.Using bloom filters to speed-up name lookup in distributed systems.The Computer Journal,2002,45(6):645-652.

共引文献28

同被引文献12

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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