期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Critical Relation Path Aggregation-Based Industrial Control Component Exploitable Vulnerability Reasoning 被引量:1
1
作者 Zibo Wang Chaobin Huo +5 位作者 Yaofang Zhang Shengtao Cheng Yilu Chen Xiaojie Wei Chao Li Bailing Wang 《Computers, Materials & Continua》 SCIE EI 2023年第5期2957-2979,共23页
With the growing discovery of exposed vulnerabilities in the Industrial Control Components(ICCs),identification of the exploitable ones is urgent for Industrial Control System(ICS)administrators to proactively forecas... With the growing discovery of exposed vulnerabilities in the Industrial Control Components(ICCs),identification of the exploitable ones is urgent for Industrial Control System(ICS)administrators to proactively forecast potential threats.However,it is not a trivial task due to the complexity of the multi-source heterogeneous data and the lack of automatic analysis methods.To address these challenges,we propose an exploitability reasoning method based on the ICC-Vulnerability Knowledge Graph(KG)in which relation paths contain abundant potential evidence to support the reasoning.The reasoning task in this work refers to determining whether a specific relation is valid between an attacker entity and a possible exploitable vulnerability entity with the help of a collective of the critical paths.The proposed method consists of three primary building blocks:KG construction,relation path representation,and query relation reasoning.A security-oriented ontology combines exploit modeling,which provides a guideline for the integration of the scattered knowledge while constructing the KG.We emphasize the role of the aggregation of the attention mechanism in representation learning and ultimate reasoning.In order to acquire a high-quality representation,the entity and relation embeddings take advantage of their local structure and related semantics.Some critical paths are assigned corresponding attentive weights and then they are aggregated for the determination of the query relation validity.In particular,similarity calculation is introduced into a critical path selection algorithm,which improves search and reasoning performance.Meanwhile,the proposed algorithm avoids redundant paths between the given pairs of entities.Experimental results show that the proposed method outperforms the state-of-the-art ones in the aspects of embedding quality and query relation reasoning accuracy. 展开更多
关键词 Path-based reasoning representation learning attention mechanism vulnerability knowledge graph industrial control component
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部