Computer Science – Networking and Internet Architecture
Scientific paper
2005-12-22
SFI Workshop: Resilient and Adaptive Defense of Computing Networks 2003, Santa Fe Institute, Santa Fe, NM, Nov 5-6, 2003
Computer Science
Networking and Internet Architecture
Scientific paper
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.
Bush Stephen F.
Hughes Todd
No associations
LandOfFree
On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696850