Patents by Inventor Kyle W. Ingols

Kyle W. Ingols has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9344444
    Abstract: In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge.
    Type: Grant
    Filed: May 10, 2011
    Date of Patent: May 17, 2016
    Assignee: Massachusettes Institute of Technology
    Inventors: Richard P. Lippmann, Kyle W. Ingols, Keith J. Piwowarski
  • Publication number: 20110231937
    Abstract: In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge.
    Type: Application
    Filed: May 10, 2011
    Publication date: September 22, 2011
    Applicant: Massachusetts Institute of Technology
    Inventors: Richard P. Lippmann, Kyle W. Ingols, Keith J. Piwowarski
  • Patent number: 7971252
    Abstract: In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge.
    Type: Grant
    Filed: June 8, 2007
    Date of Patent: June 28, 2011
    Assignee: Massachusetts Institute of Technology
    Inventors: Richard P. Lippmann, Kyle W. Ingols, Keith J. Piwowarski
  • Publication number: 20090293128
    Abstract: In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge.
    Type: Application
    Filed: June 8, 2007
    Publication date: November 26, 2009
    Inventors: Richard P. Lippmann, Kyle W. Ingols, Keith J. Piwowarski
  • Patent number: 7194769
    Abstract: Described are techniques used for assessing the security of a network. Pruned attack trees are generated using a forward chaining, breadth-first technique representing the attack paths of a possible attacker in the network. A vulnerability score is determined for each network and attacker starting point using attack loss values assigned to each host and information extracted from the attack tree(s) concerning compromised hosts. Different hypothetical alternatives may be evaluated to improve security of the network and each alternative may be evaluated by recomputing the network vulnerability score and comparing the recomputed score to the original network vulnerability score. Also disclosed is a method for determining end-to-end connectivity of a network. The resulting end-to-end connectivity information is used in generating the pruned attack tree.
    Type: Grant
    Filed: December 11, 2003
    Date of Patent: March 20, 2007
    Assignee: Massachusetts Institute of Technology
    Inventors: Richard Lippmann, Chris Scott, Kendra Kratkiewicz, Michael Artz, Kyle W. Ingols