IP Library Granted Patent US 12,401,677
Granted Patent B2
US 12,401,677 · App. 18/494,871 · Granted Aug 26, 2025

Risk-based cyber detection system

Inventor: David Makovoz (Silver Spring, MD)
H04L63/1433H04L41/22H04L63/1416
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,401,677
App. No.
18/494,871
Granted
Aug 26, 2025
Kind
B2
Abstract

A system that comprises a computer including a processor and a memory is disclosed. The memory includes instructions such that the processor is programmed to: determine a risk level corresponding to an alert, the alert corresponding to at least one node of a plurality of nodes of a communication network; calculate a risk level propagation based on the risk level; and generate a response corresponding to a node type of the at least one node when the risk level exceeds a response threshold.

Claims (140)

1. A system comprising a computer including a processor and a memory, the memory including instructions such that the processor is programmed to:

determine a risk level corresponding to an alert, the alert corresponding to at least one node of a plurality of nodes of a communication network, wherein the risk level is determined according to

R

i

(

t

+

1

)

=

j

𝒩

i

(

R

j

(

t

)

,

R

i

(

t

)

decay

i

,

W

ij

)

,

 where Σj∈ is a summation over all nodes j in a set Ni, R i (t+1) is the risk level corresponding to the at least one node at time t+1, is the risk level function, R j (t) is a risk level at time t for a node adjacent to the at least one node, R i (t) is a risk level at time t for the at least one node, decay i is a decay constant corresponding to the at least one node, W ij is a likelihood of communication between the at least one node and the adjacent node, and is the set of all nodes connected to node V i ;

calculate a risk level propagation based on the risk level;

generate a response corresponding to a node type of the at least one node when the risk level exceeds a response threshold; and

update a risk level of another node of the plurality of nodes based on the risk level propagation.

2. The system as recited in claim 1 , wherein the processor is further programmed to receive the alert from an endpoint monitoring agent corresponding to the at least one node.

3. The system as recited in claim 1 , wherein the processor is further programmed to generate a graph representing the plurality of nodes of the communication network.

4. The system as recited in claim 1 , wherein the processor is further programmed to generate a risk graph, the risk graph including one or more nodes of the plurality of nodes, wherein the one or more nodes comprise a risk value exceeding a predefined risk threshold.

5. The system as recited in claim 1 , wherein the response comprises deprovisioning of the at least one node.

6. The system as recited in claim 1 , wherein the response comprises isolating the at least one node.

7. The system as recited in claim 1 , wherein the processor is further programmed to access a data structure to determine the risk level, wherein the data structure includes a mapping of the alert to the risk level.

8. A method comprising:

determining a risk level corresponding to an alert, the alert corresponding to at least one node of a plurality of nodes of a communication network, wherein the risk level is determined according to

R

i

(

t

+

1

)

=

j

𝒩

i

(

R

j

(

t

)

,

R

i

(

t

)

decay

i

,

W

ij

)

,

 where Σj∈ is a summation over all nodes j in a set Ni, R i (t+1) is the risk level corresponding to the at least one node at time t+1, is the risk level function, R j (t) is a risk level at time t for a node adjacent to the at least one node, R i (t) is a risk level at time t for the at least one node, decay i is a decay constant corresponding to the at least one node, W ij is a likelihood of communication between the at least one node and the adjacent node, and is the set of all nodes connected to node V i ;

calculating a risk level propagation based on the risk level;

generating a response corresponding to a node type of the at least one node when the risk level exceeds a response threshold; and

updating a risk level of another node of the plurality of nodes based on the risk level propagation.

9. The method as recited in claim 8 , further comprising receiving the alert from an endpoint monitoring agent corresponding to the at least one node.

10. The method as recited in claim 8 , further comprising generating a graph representing the plurality of nodes of the communication network.

11. The method as recited in claim 8 , further comprising generating a risk graph, the risk graph including one or more nodes of the plurality of nodes, wherein the one or more nodes comprise a risk value exceeding a predefined risk threshold.

12. The method as recited in claim 8 , wherein the response comprises deprovisioning of the at least one node.

13. The method as recited in claim 8 , wherein the response comprises isolating the at least one node.

14. The method as recited in claim 8 , further comprising accessing a data structure to determine the risk level, wherein the data structure includes a mapping of the alert to the risk level.

15. A system comprising a computer including a processor and a memory, the memory including instructions such that the processor is programmed to:

determine a risk level corresponding to an alert, the alert corresponding to at least one node of a plurality of nodes of a communication network, wherein the risk level is determined according to

R

i

(

t

+

1

)

=

j

𝒩

i

(

R

j

(

t

)

,

R

i

(

t

)

decay

i

,

W

ij

)

,

 where Σj∈ is a summation over all nodes j in a set Ni, R i (t+1) is the risk level corresponding to the at least one node at time t+1, is the risk level function, R j (t) is a risk level at time t for a node adjacent to the at least one node, R i (t) is a risk level at time t for the at least one node, decay i is a decay constant corresponding to the at least one node, W ij is a likelihood of communication between the at least one node and the adjacent node, and is the set of all nodes connected to node V i ;

calculate a risk level propagation based on the risk level;

generate a response corresponding to a node type of the at least one node when the risk level exceeds a response threshold, the response comprising at least one of deprovisioning of the at least one node or isolating the at least one node; and

update a risk level of another node of the plurality of nodes based on the risk level propagation.

16. The system as recited in claim 15 , wherein the processor is further programmed to determine the likelihood of risk propagation based on a communication type between the first node and the second node.

17. The system as recited in claim 15 , wherein the processor is further programmed to calculate the risk value for each node based on an alert type corresponding to each node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2023
From: MAKOVOZ, DAVID
To: CYBERACTIVE TECHNOLOGIES LLC
Reel/Frame 065352/0805 →
Continuity (1)
Related Publication 20250141909A1 · May 1, 2025
References Cited (7)
US 12155691B2 · Koral · 2024 [cited by examiner]
US 20160249085A1 · Ben-Atiya · 2016 [cited by examiner]
US 20180144138A1 · Zhang · 2018 [cited by examiner]
US 20190098028A1 · Ektare · 2019 [cited by examiner]
US 20200100115A1 · Skaaksrud · 2020 [cited by examiner]
US 20210303699A1 · Cheng · 2021 [cited by examiner]
US 20230325683A1 · Johnson · 2023 [cited by examiner]