Search
Now showing items 1-10 of 19
Attack Generation for NIDS Testing Using Natural Deduction
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
A common way to elude a signature-based NIDS is to transform an attack instance that the NIDS recognizes into another instance that it fails to recognize. For example, to avoid matching between the attack payload and the ...
Retrofitting Legacy Code for Authorization Policy Enforcement
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Researchers have long argued that the best way to construct a secure system is to proactively integrate security into the design of the system. However, this tenet is rarely followed because of economic and practical ...
On Effective Model-Based Intrusion Detection
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Model-based intrusion detectors restrict program execution to a previously computed model of expected behavior. We consider two classes of attacks against these systems: bypass attacks that evade detection by avoiding the ...
Formalizing Attack Mutation for NIDS Testing
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Attack mutation is a common way to test a misuse Network Intrusion Detection System (NIDS). In this technique, a known instance of an attack is transformed by repeatedly applying attack transformations into many distinct ...
Malware Normalization
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Malware is code designed for a malicious purpose, such as obtaining root privilege on a host. A malware detector identifies malware and thus prevents it from adversely affecting a host. In order to evade detection by ...
Buffer Overrun Detection Using Linear Programming and Static Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 2003)
This paper addresses the issue of identifiing buffer overrun vulnerabilities by statically analyzing C source code. We demonstrate a scalable analysis based on modeling C string manipulations as a linear program. We also ...
Security Policy Reconciliation in Distributed Computing Environments
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
A major hurdle in sharing resources between organizations is heterogeneity. Therefore, in order for two organizations to collaborate their policies have to be resolved. The process of resolving different policies is known ...
Towards Discovering and Containing Privacy Violations in Software
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
Malicious code can wreak havoc on our cyberinfrastructure. Hence, discovering and containing malicious code is an important goal. This paper focuses on privacy-violating malicious code. Examples of privacy violations ...
Reducing the Dependence of Trust-Management Systems on PKI
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Trust-management systems address the authorization problem in distributed systems by defining a formal language for expressing authorization and access-control policies, and relying on an algorithm to determine when a ...
Distributed Certificate-Chain Discovery in SPKI/SDSI
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
The authorization problem is to decide whether, according to a security policy, some principal should be allowed access to a resource. In the trust-management system SPKI/SDSI, the security policy is given by a set of ...










