# US 2019/0173923 A1 · Systems and methods for quantitative assessment of a computer defense technique

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0173923 A1
- Document ID: US20190173923A1
- Status: Published application
- Kind: A1
- Application number: 15/829,827
- Filed: 2017-12-01
- Published: 2019-06-06
- Earliest claimed: 2017-12-01
- Assignees: Massachusetts Institute of Technology
- Applicants: Massachusetts Institute of Technology
- Inventors: Richard W. Skowyra; Steven R. Gomez
- Web page: https://patentgrep.com/patent/US20190173923A1

## CPC

- H04L 63/205: {involving negotiation or determination of the one or more network security mechanisms to be used, e.g. by negotiation between the client and the server or between peers or by selection according to the capabilities of the entities involved (negotiation of communication capabilities H04L69/24)}
- G06F 16/9027: {Trees}
- G06F 16/903: Querying (for retrieval from the web G06F16/953)
- G06F 17/11: for solving equations {, e.g. nonlinear equations, general mathematical optimization problems (optimization specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 5/02: Knowledge representation; Symbolic representation
- H04L 63/105: {Multiple levels of security}
- H04L 63/1433: {Vulnerability analysis}
- H04L 63/1441: {Countermeasures against malicious traffic (countermeasures against attacks on cryptographic mechanisms H04L9/002)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer-implemented method for quantitatively assessing a defense technique. The method includes executing a reasoning engine that receives as an input to the reasoning engine a query that includes an indicia of a defense technique to a computer security threat. The method further includes translating the defense technique into a propositional logic constraint on a queryable representation of a Boolean formula representing a model complied from a set of computer security threats and a set of defense techniques. The method also includes performing an assessment of the defense technique based on the propositional logic constraint on the queryable representation, to quantify the defense technique relative to a member of the set of computer security threats. The method further includes displaying a result of the assessment to indicate a level of security provided by the defense technique to the member.

## Claims

### Claim 1

A computer-implemented method for assessing a defense technique, the method comprising:
executing a reasoning engine that receives as an input to the reasoning engine a query that includes an indicia of a defense technique to a computer security threat;
translating, using the reasoning engine, the defense technique into a propositional logic constraint on a queryable representation of a Boolean formula representing a model complied from a set of computer security threats and a set of defense techniques;
performing, using the reasoning engine, an assessment of the defense technique based on the propositional logic constraint on the queryable representation, to quantify the defense technique relative to a member of the set of computer security threats; and
displaying, using the reasoning engine, a result of the assessment to indicate a level of security provided by the defense technique to the member.

### Claim 2 (depends on 1)

The method of claim 1, wherein the queryable representation of the Boolean formula is in smoothed deterministic decomposable negation normal form stored in a memory.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
accepting, using a model compiler, as a first input a representation of the set of computer security threats;
accepting, using the model compiler, as a second input a representation of the set of defense techniques;
compiling, using the model compiler, the first input and the second input into the Boolean formula representing the set of computer security threats and the set of defense techniques;
accepting, using a #SAT satisfiability solver, as a first input the Boolean formula; and
encoding, using the #SAT satisfiability solver, the Boolean formula into the queryable representation.

### Claim 4 (depends on 3)

The method of claim 3, wherein the representation of the set of computer security threats is a tree-like structure with a root node and one or more leaf nodes, the root node and the one or more leaf nodes representing capabilities of the set of computer security threats.

### Claim 5 (depends on 4)

The method of claim 4, wherein the root node is dependent on the one or more leaf nodes, the root node requiring all of the one or more leaf nodes or any of the one or more leaf nodes to be used.

### Claim 6 (depends on 3)

The method of claim 3, wherein the Boolean formula is in conjunctive normal form.

### Claim 7 (depends on 3)

The method of claim 3, further comprising holding the first input and the second input in a repository stored on a database.

### Claim 8 (depends on 3)

The method of claim 3, further comprising using a semantic enrichment module, metadata to reintroduce computer security threat information and defense technique information into the queryable representation that was lost during the conversion of the Boolean formula to the queryable representation.

### Claim 9 (depends on 1)

The method of claim 1, further comprising performing, using the reasoning engine, the assessment to identify one or more computer security threats unconstrained by the defense technique.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
receiving, using a user interface, the query from a user; and
displaying, using the user interface, the result.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
determining, using a metrics computation engine, a number of computer security threats available when the defense technique is deployed; and
computing, using the metrics computation engine, a defense coverage value associated with the number of computer security threats available when the defense technique is deployed, to a number of computer security threats available when no defense techniques are deployed.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
determining, using a metrics computation engine, a first number of computer security threats from the set of computer security threats that are available when the defense technique is deployed;
determining, using the metrics computation engine, a second number of computer security threats from the set of computer security threats that are available when the defense technique is deployed that depend on a common threat capability; and
computing, using the metrics computation engine, a threat criticality value for the common threat capability by dividing the second number by the first number, the threat criticality value associated with a proportion of successful computer security threats that rely on an availability of the common threat capability.

### Claim 13 (depends on 1)

The method of claim 1, wherein the defense technique is a set of constraints of the representation that disables one or more computer security threats.

### Claim 14

A system comprising:
a memory storing executable instructions to execute:
a reasoning engine:
receives as an input a query that includes an indicia of a defense technique to a computer security threat;
translating the defense technique into a propositional logic constraint on a queryable representation of a Boolean formula representing a model complied from a set of computer security threats and a set of defense techniques;
performing an assessment of the defense technique based on the propositional logic constraint on the queryable representation, to quantify the defense technique relative to a member of the set of computer security threats; and
displaying a result of the assessment to indicate a level of security provided by the defense technique to the member; and
a processor coupled to the memory to execute the executable instructions stored therein to generate as output the result of the query.

### Claim 15 (depends on 14)

The system of claim 14, wherein the queryable representation of the Boolean formula is in smoothed deterministic decomposable negation normal form stored in the memory.

### Claim 16 (depends on 14)

The system of claim 14, the memory storing executable instructions to execute:
a model compiler:
accepting as a first input a representation of the set of computer security threats;
accepting as a second input a representation of the set of defense techniques; and
compiling the first input and the second input into the Boolean formula representing the set of computer security threats and the set of defense techniques; and
a #SAT satisfiability solver:
accepting as a first input the Boolean formula; and
encoding the Boolean formula into the queryable representation.

### Claim 17 (depends on 16)

The system of claim 16, wherein the representation of the set of computer security threats is a tree-like structure with a root node and one or more leaf nodes, the root node and the one or more leaf nodes representing capabilities of the set of computer security threats.

### Claim 18 (depends on 17)

The system of claim 17, wherein the root node is dependent on the one or more leaf nodes, the root node requiring all of the one or more leaf nodes or any of the one or more leaf nodes to be used.

### Claim 19 (depends on 16)

The system of claim 16, wherein the Boolean formula is in conjunctive normal form.

### Claim 20 (depends on 3)

The system of claim 3, further comprising a repository stored on a database, the repository holding the first input and the second input.

### Claim 21 (depends on 16)

The system of claim 16, further comprising a semantic enrichment module configured to use metadata to reintroduce computer security threat information and defense technique information into the queryable representation that was lost during the conversion of the Boolean formula to the queryable representation.

### Claim 22 (depends on 14)

The system of claim 14, wherein the reasoning engine performs the assessment to identify one or more computer security threats unconstrained by the defense technique.

### Claim 23 (depends on 14)

The system of claim 14, further comprising a user interface that receives the query from a user using the user interface and displays the result.

### Claim 24 (depends on 14)

The system of claim 14, further comprising a metrics computation engine configured to:
determine a number of known computer security threats available when the defense technique is deployed; and
compute a defense coverage value associated with the number of computer security threats available when the defense technique is deployed, to a number of computer security threats available when no defense techniques are deployed.

### Claim 25 (depends on 14)

The system of claim 14, further comprising a metrics computation engine configured to:
determine a first number of computer security threats from the set of computer security threats that are available when the defense technique is deployed;
determine a second number of computer security threats from the set of computer security threats that are available when the defense technique is deployed that depend on a common threat capability; and
compute a threat criticality value for the common threat capability by dividing the second number by the first number, the threat criticality value associated with a proportion of successful computer security threats that rely on an availability of the common threat capability.

### Claim 26 (depends on 14)

The system of claim 14, wherein the defense technique is a set of constraints of the representation that disables one or more computer security threats.

### Claim 27

A non-transitory computer readable medium storing instructions executable by a processing device, wherein execution of the instructions causes the processing device to implement a method for assessing a defense technique comprising:
receiving, using a reasoning engine, as an input a query that includes an indicia of a defense technique to a computer security threat;
translating, using the reasoning engine, the defense technique into a propositional logic constraint on a queryable representation of a Boolean formula representing a model complied from a set of computer security threats and a set of defense techniques;
performing, using the reasoning engine, an assessment of the defense technique based on the propositional logic constraint on the queryable representation, to quantify the defense technique relative to a member of the set of computer security threats; and
displaying, using the reasoning engine, a result of the assessment to indicate a level of security provided by the defense technique to the member.

### Claim 28 (depends on 27)

The non-transitory computer readable medium of claim 27, wherein the queryable representation of the Boolean formula is in smoothed deterministic decomposable negation normal form stored in a memory.

### Claim 29 (depends on 27)

The non-transitory computer readable medium of claim 27, further comprising:
accepting, using a model compiler, as a first input a representation of the set of computer security threats;
accepting, using the model compiler, as a second input a representation of the set of defense techniques; and
compiling, using the model compiler, the first input and the second input into the Boolean formula representing the set of computer security threats and the set of defense techniques; and
accepting, using a #SAT satisfiability solver, as a first input the Boolean formula; and
encoding, using the #SAT satisfiability solver, the Boolean formula into the queryable representation.

### Claim 30 (depends on 29)

The non-transitory computer readable medium of claim 29, wherein the representation of the set of computer security threats is a tree-like structure with a root node and one or more leaf nodes, the root node and the one or more leaf nodes representing capabilities of the set of computer security threats.

### Claim 31 (depends on 30)

The non-transitory computer readable medium of claim 30, wherein the root node is dependent on the one or more leaf nodes, the root node requiring all of the one or more leaf nodes or any of the one or more leaf nodes to be used.

### Claim 32 (depends on 29)

The non-transitory computer readable medium of claim 29, wherein the Boolean formula is in conjunctive normal form.

### Claim 33 (depends on 29)

The non-transitory computer readable medium of claim 29, further comprising holding the first input and the second input in a repository stored on a database.

### Claim 34 (depends on 29)

The non-transitory computer readable medium of claim 29, further comprising using a semantic enrichment module, metadata to reintroduce computer security threat information and defense technique information into the queryable representation that was lost during the conversion of the Boolean formula to the queryable representation.

### Claim 35 (depends on 27)

The non-transitory computer readable medium of claim 27, further comprising performing, using the reasoning engine, the assessment to identify one or more computer security threats unconstrained by the defense technique.

### Claim 36 (depends on 27)

The non-transitory computer readable medium of claim 27, further comprising:
receiving, using a user interface, the query from a user; and
displaying, using the user interface, the result.

### Claim 37 (depends on 27)

The non-transitory computer readable medium of claim 27, further comprising:
determining, using a metrics computation engine, a number of computer security threats available when the defense technique is deployed; and
computing, using the metrics computation engine, a defense coverage value associated with the number of computer security threats available when the defense technique is deployed, to a number of computer security threats available when no defense techniques are deployed.

### Claim 38 (depends on 27)

The non-transitory computer readable medium of claim 27, further comprising:
determining, using a metrics computation engine, a first number of computer security threats from the set of computer security threats that are available when the defense technique is deployed;
determining, using the metrics computation engine, a second number of computer security threats from the set of computer security threats that are available when the defense technique is deployed that depend on a common threat capability; and
computing, using the metrics computation engine, a threat criticality value for the common threat capability by dividing the second number by the first number, the threat criticality value associated with a proportion of successful computer security threats that rely on an availability of the common threat capability.

### Claim 39 (depends on 27)

The non-transitory computer readable medium of claim 27, wherein the defense technique is a set of constraints of the representation that disables one or more computer security threats.
