A privacy-preserving multi-step attack correlation algorithm

Minyi Xian, Yongtang Zhang
{"title":"A privacy-preserving multi-step attack correlation algorithm","authors":"Minyi Xian, Yongtang Zhang","doi":"10.1109/IMCEC.2016.7867441","DOIUrl":null,"url":null,"abstract":"Traditional multi-step attack correlation approaches based on intrusion alerts face the challenge of recognizing attack scenarios because these approaches require complex pre-defined association rules as well as a high dependency on expert knowledge. Meanwhile, they barely consider the privacy issues. Under such circumstance, a novel algorithm is proposed to construct multi-step attack scenarios based on discovering attack behavior sequential patterns. It analyzes time sequential characteristics of attack behaviors and implements a support evaluation method. An optimized candidate attack sequence generation method is applied to solve the problem of pre-defined association rules complexity as well as expert knowledge dependency. An enhanced k-anonymity method is applied on this algorithm to realize privacy-preserving feature Experimental results indicate that the algorithm has comparatively better performance and accuracy on multi-step attack correlation and reaches a well balance between efficiency and privacy issues.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCEC.2016.7867441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Traditional multi-step attack correlation approaches based on intrusion alerts face the challenge of recognizing attack scenarios because these approaches require complex pre-defined association rules as well as a high dependency on expert knowledge. Meanwhile, they barely consider the privacy issues. Under such circumstance, a novel algorithm is proposed to construct multi-step attack scenarios based on discovering attack behavior sequential patterns. It analyzes time sequential characteristics of attack behaviors and implements a support evaluation method. An optimized candidate attack sequence generation method is applied to solve the problem of pre-defined association rules complexity as well as expert knowledge dependency. An enhanced k-anonymity method is applied on this algorithm to realize privacy-preserving feature Experimental results indicate that the algorithm has comparatively better performance and accuracy on multi-step attack correlation and reaches a well balance between efficiency and privacy issues.
一种保护隐私的多步攻击关联算法
传统的基于入侵警报的多步骤攻击关联方法由于需要复杂的预定义关联规则以及对专家知识的高度依赖,在识别攻击场景方面面临挑战。同时,他们很少考虑隐私问题。针对这种情况,提出了一种基于发现攻击行为序列模式来构建多步攻击场景的新算法。分析了攻击行为的时间序列特征,实现了一种支持度评估方法。采用一种优化的候选攻击序列生成方法,解决了预定义关联规则复杂性和专家知识依赖的问题。实验结果表明,该算法在多步攻击关联方面具有较好的性能和准确性,在效率和隐私问题之间取得了很好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信