×

Lateral movement detection through graph-based candidate selection

  • US 10,462,169 B2
  • Filed: 04/29/2017
  • Issued: 10/29/2019
  • Est. Priority Date: 04/29/2017
  • Status: Active Grant
First Claim
Patent Images

1. A method, comprising:

  • accessing, by a computer system, event data indicative of a plurality of events related to a plurality of entities associated with a network;

    identifying, by the computer system, based on the event data, lateral movement candidate entities by identifying a subset of the plurality of entities as being associated with particular events that indicate lateral movement in the network;

    creating, by the computer system, based on the event data, a graph data structure that is indicative of a sequence of events associated with the lateral movement candidate entities, wherein the graph data structure includes a plurality of nodes and one or more connections between the nodes, each of the nodes represents an entity of the plurality of entities and is associated, via the graph data structure, with a feature vector that is derived from a set of events that are associated with the node, and a connection from a first node to a second node in the graph data structure represents a sequence of events in the plurality of events; and

    analyzing, by the computer system, the graph data structure to identify a potential security threat by identifying a subset of the lateral movement candidate entities that are associated with a particular sequence of events.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×