arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0512089cs.NIcs.CR
收藏

Kolmogorov复杂度估计在语义类型判别中的有效性

On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types

Stephen F. Bush, Todd Hughes

摘要:

我们提出了一个基本的和普遍适用的漏洞分析框架,能够识别攻击者创新攻击之前的新类型的漏洞的实验验证的进展。这个新框架根据Kolmogorov复杂性估计主动识别易受攻击的系统组件,并有助于预测可能被未来攻击方法利用的以前未知的漏洞。一个工具,利用不断增长的库的复杂性估计。这项工作是朝着验证基于复杂性的脆弱性分析概念迈出的一个渐进步骤。特别是,结果表明,数据类型(语义类型),可以确定其复杂性的估计。因此,复杂度映射可以识别可疑类型,诸如嵌入被动数据类型内的可执行数据,而无需求助于预定义的报头、签名或其他限制性先验信息。

英文摘要:

We present progress on the experimental validation of a fundamental and universally applicable vulnerability analysis framework that is capable of identifying new types of vulnerabilities before attackers innovate attacks. This new framework proactively identifies system components that are vulnerable based upon their Kolmogorov Complexity estimates and it facilitates prediction of previously unknown vulnerabilities that are likely to be exploited by future attack methods. A tool that utilizes a growing library of complexity estimators is presented. This work is an incremental step towards validation of the concept of complexity-based vulnerability analysis. In particular, results indicate that data types (semantic types) can be identified by estimates of their complexity. Thus, a map of complexity can identify suspicious types, such as executable data embedded within passive data types, without resorting to predefined headers, signatures, or other limiting a priori information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑