IP Library Granted Patent US 12,326,943
Granted Patent B2
US 12,326,943 · App. 18/219,549 · Granted Jun 10, 2025

Intelligent adversary simulator

Inventor: Carl Joseph Salji (Bedford, GB)
Assignee: Darktrace Holdings Limited
G06F21/577G06F9/455G06F16/953G06N5/04G06N20/00H04L63/1425
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,326,943
App. No.
18/219,549
Filed
Jul 7, 2023
Granted
Jun 10, 2025
Kind
B2
Art Unit
2434
USPC
726/25
Abstract

An apparatus features processor(s) and a non-transitory storage medium including an intelligent-adversary simulator and a formatting modules. The simulator calculates path(s) of least resistance for a cyber threat in a cyber-attack scenario to compromise 1) a first virtualized instance (source device), 2) a second virtualized instance (targeted device), and 3) virtualized instances of components of a virtualized instance of a network associated with selected pathways of the cyber-attack scenario through the virtualized instance of the network. The virtualized instances may be based on historical knowledge of connectivity and behaviour patterns of users and devices within an actual network under analysis. The formatting module generates a report with identified devices that are communicatively coupled to the virtualized instance of the network and prioritized to allocate security resources. The simulator calculates the least resistance path(s) through the virtualized instance of the network and refrains from calculating every theoretically path therefrom.

Claims (36)

1. An apparatus, comprising:

one or more processors; and

one or more non-transitory storage mediums accessible by the one or more processors, wherein the non-transitory storage mediums are configured to store software for execution by the one or more processors,

an intelligent-adversary simulator configured to calculate one or more paths of least resistance for a cyber threat in a cyber-attack scenario to compromise 1) a virtualized instance associated with a source device, 2) a virtualized instance associated with a targeted device, and 3) virtualized instances of one or more users, other devices, and any combinations of both of a virtualized instance of a network associated with selected pathways of the cyber-attack scenario through the virtualized instance of the network, wherein at least the virtualized instances of the users and/or other devices are based on historical knowledge of connectivity and behaviour patterns of actual users and devices within an actual network under analysis, wherein the intelligent-adversary simulator is configured to calculate a weight of how difficult it would be to compromise the users and/or other devices represented in the virtualized instance of the network as well as then assign to the users and/or other devices the calculated weight to resist the compromise from the cyber threat being simulated in the cyber-attack scenario during a simulation;

a formatting module is configured to generate a report with at least identified devices in the virtualized instance of the network with an assigned priority to allocate security resources to that identified device;

and

wherein the intelligent-adversary simulator is configured to calculate a subset of the one or more paths of least resistance to the cyber threat through the virtualized instance of the network and refrain from calculating every theoretically path; and thus exclude certain paths of least resistance, from the virtualized instance associated with the source device to the virtualized instance of the targeted device to reduce an amount of computing cycles needed by the one or more processors as well as an amount of memory storage needed by the non-transitory storage mediums, wherein the one or more non-transitory storage mediums are configured to store the software for the intelligent-adversary simulator and the formatting module, which are then configured to be executed by the one or more processors.

2. The apparatus of claim 1 , wherein the intelligent-adversary simulator is configured to construct a graph of the virtualized instance of the network including at least a) the virtualized instance associated with the source device, b) the virtualized instance associated with the targeted device, c) the virtualized instance of the one or more users, additional devices, and any combinations of both, and d) connections and pathways corresponding to the selected pathways through the virtualized instance of the network.

3. The apparatus of claim 1 , wherein a graph of the virtualized instance of the network is constructed in order to run a simulated cyber-attack scenario on the virtualized instance of the one or more users, other devices, and any combinations of both in order to generate information associated with the identified devices communicatively coupled to the virtualized instance of the network that are critical from a security standpoint and placement of the information into the generated report.

4. The apparatus of claim 3 , wherein the graph of the virtualized instance of the network is configured to assist to prioritize which of the identified devices should have a priority to allocate security resources based on the simulation of the cyber-attack scenario.

5. The apparatus of claim 1 , wherein the intelligent-adversary simulator is configured to search and query of i) a data store, ii) modules, or iii) one or more Artificial Intelligence (AI) models forming a cyber security appliance protecting the actual network under analysis from cyber threats for data known about the network and components of the network to create a graph of the virtualized instance of the network,

wherein the graph of the virtualize instance of the network is created with a plurality of 1) known characteristics of the network, 2) pathways or connections between the devices of the network, 3) security features and credentials of the devices or users of the devices, and 4) behavioural characteristics of the devices or the users of the devices.

6. The apparatus of claim 1 , wherein the non-transitory storage medium further comprises:

a profile manager module configured to communicate and cooperate with the intelligent-adversary simulator, where the profile manager module is configured to maintain a profile tag on each device, including the source device, connecting to the actual network under analysis based on behaviour and security characteristics of that device and then supply the profile tags for the devices during a construction of a graph.

7. The apparatus of claim 1 , wherein the non-transitory storage medium further comprises:

a profile manager module configured to maintain a profile tag for each of the devices before the simulation is carried out to eliminate a need to search and query for known data about each device being simulated during the simulation, wherein the profile manager module is configured to maintain the profile tag on each device based on device behaviour as detected by a network module cooperating with network probes ingesting traffic data for network devices and network users in the network under analysis as well as cooperation and analysis with Artificial Intelligence (AI) models modelling a normal pattern of life for entities in the network under analysis.

8. A method for threat hunting for cyber threats, comprising:

constructing a graph of a virtualized instance of a network that is based on an actual network under analysis and is represented by i) connections and pathways between virtualized instances of components spanning through the virtualized instance of the network and ii) virtualized instance of one or more users, devices and any combinations of both connected to the virtualized instance of the network, where the graph of the virtualized instance of the network is constructed in order to run a simulated cyber-attack scenario on the virtualized instance of the network;

calculating a weight of how difficult it would be to compromise the users and/or other devices represented in the virtualized instance of the network as well as then assigning to the users and/or devices the calculated weight to resist the compromise from the cyber threat being simulated in the simulated cyber-attack scenario;

calculating one or more paths of least resistance for a cyber threat in the simulated cyber-attack scenario to compromise 1) a virtualized instance associated with a source device of the one or more devices connected to the virtualized instance of the network, 2) a virtualized instance associated with a targeted device of the one or more devices, and 3) the virtualized instances of components of the virtualized instance of the network, wherein the virtualized instances of components being based on historical knowledge of connectivity and behaviour patterns of actual users and devices within the actual network under analysis;

generating a report with identified devices in the virtualized instance of the virtualized network that should have a priority to allocate security resources; and

calculating merely a subset of the one or more paths of least resistance through the virtualized instance of the network further refrains from calculating every theoretically path; and

thus exclude certain paths of least resistance, from the virtualized instance of the source device to the virtualized instance associated with the targeted device to reduce an amount of computing and memory resources.

9. The method of claim 8 , wherein the constructing of the graph of the virtualized instance of the network by an intelligent-adversary simulator comprises a) the virtualized instance associated with the source device, b) the virtualized instance associated with the target device, c) the virtualized instance of the devices, and d) the connections and pathways corresponding to a selected pathway through the virtualized instance of the network.

10. The method of claim 8 , wherein the constructing of the graph of the virtualized instance of the network is performed during the simulated cyber-attack scenario on the virtualized instance of the devices, in order to generate information that identifies one or more devices coupled to the virtualized instance of the network that are critical from a security standpoint, and place the information into the generated report.

11. The method of claim 10 , wherein the graph of the virtualized instance of the network is configured to assist to prioritize which of the one or more devices should have a priority to allocate security resources based on the simulated cyber-attack scenario.

12. The method of claim 8 , wherein the constructing of the graph of the virtualized instance of the network includes conducting virtualized instance of subnetworks associated with the network.

13. The method of claim 8 , wherein the constructing of the graph by an intelligent-adversary simulator is configured to search and query of i) a data store, ii) modules, or iii) one or more Artificial Intelligence (AI) models forming a cyber security appliance protecting the actual network under analysis from cyber threats for data known about the network and devices of the network to create the graph of the virtualized instance of the network.

14. The method of claim 13 , wherein the data known about the network and the devices of the network include data associated with 1) known characteristics of the network, 2) the pathways or connections between the devices of the network, 3) security features and credentials of the devices or users of the devices, and 4) behavioural characteristics of the devices or the users of the devices.

15. The method of claim 8 , further comprising:

maintaining a profile tag on each of the one or more actual devices connecting to the actual network under analysis based on behaviour and security characteristics of a corresponding device; and

supplying the profile tags for each of the one or more devices connecting to the virtualized instance of the network during the constructing of the graph.

16. The method of claim 15 , wherein the profile tag for each of the one or more devices is maintained before the simulated cyber-attack scenario is carried out to eliminate a need to search and query for known data about each device being simulated during the simulation.

17. A non-transitory storage medium including software that, upon execution by one or more processors, perform threat hunting for cyber threats, comprising:

an intelligent-adversary simulator configured to calculate one or more paths of least resistance for a cyber threat in a cyber-attack scenario to compromise 1) a virtualized instance associated with a source device, 2) a virtualized instance associated with a targeted device, and 3) virtualized instances of one or more users, other devices, and any combinations of both forming a virtualized instance of a network associated with selected pathways of the cyber-attack scenario through the virtualized instance of the network, wherein at least the virtualized instances being based on historical knowledge of connectivity and behaviour patterns of actual users and devices within the actual network under analysis, wherein the intelligent-adversary simulator is configured to calculate a weight of how difficult it would be to compromise the users and/or other devices represented in the virtualized instance of the network as well as then assign to the users and/or other devices the calculated weight to resist the compromise from the cyber threat being simulated in the cyber-attack scenario during a simulation; and

a formatting module is configured to generate a report with identified devices communicatively coupled to the virtualized instance of the virtualized network that should be assigned priority to allocate security resources, wherein the intelligent-adversary simulator is configured to calculate a subset of the one or more paths of least resistance through the virtualized instance of the network and refrain from calculating every theoretically path; and thus exclude certain paths of least resistance, from the virtualized instance of the source device to the virtualized instance of the targeted device to at least reduce an amount of memory storage needed by the non-transitory storage medium.

Assignments (2)
SECURITY INTEREST Recorded Apr 7, 2025
From: DARKTRACE HOLDINGS LIMITED
To: GOLDMAN SACHS BANK USA, AS COLLATERAL AGENT
Reel/Frame 070762/0576 →
SECURITY INTEREST Recorded Apr 7, 2025
From: DARKTRACE HOLDINGS LIMITED
To: GOLDMAN SACHS BANK USA, AS COLLATERAL AGENT
Reel/Frame 070762/0592 →
Continuity (3)
Continuation 17004392 · Aug 27, 2020
Provisional Application 62893350 · Aug 29, 2019
Related Publication 20230351027A1 · Nov 2, 2023
References Cited (186)
US 6154844A · Touboul et al. · 2000 [cited by applicant]
US 6965968B1 · Touboul · 2005 [cited by applicant]
US 7307999B1 · Donaghey · 2007 [cited by applicant]
US 7418731B2 · Touboul · 2008 [cited by applicant]
US 7448084B1 · Apap et al. · 2008 [cited by applicant]
US 7890869B1 · Mayer et al. · 2011 [cited by applicant]
US 8312540B1 · Kahn et al. · 2012 [cited by applicant]
US 8407798B1 · Lotem · 2013 [cited by examiner]
US 8661538B2 · Cohen-Ganor et al. · 2014 [cited by applicant]
US 8819803B1 · Richards et al. · 2014 [cited by applicant]
US 8879803B2 · Ukil et al. · 2014 [cited by applicant]
US 8881288B1 · Levy · 2014 [cited by examiner]
US 8966036B1 · Asgekar et al. · 2015 [cited by applicant]
US 9043905B1 · Allen et al. · 2015 [cited by applicant]
US 9106687B1 · Sawhney et al. · 2015 [cited by applicant]
US 9185095B1 · Moritz et al. · 2015 [cited by applicant]
US 9213990B2 · Adjaoute · 2015 [cited by applicant]
US 9292695B1 · Bassett · 2016 [cited by examiner]
US 9344444B2 · Lippmann · 2016 [cited by examiner]
US 9348742B1 · Brezinski · 2016 [cited by applicant]
US 9369484B1 · Lacerte · 2016 [cited by examiner]
US 9401925B1 · Guo et al. · 2016 [cited by applicant]
US 9516039B1 · Yen et al. · 2016 [cited by applicant]
US 9516053B1 · Muddu et al. · 2016 [cited by applicant]
US 9641544B1 · Treat et al. · 2017 [cited by applicant]
US 9712548B2 · Shmueli et al. · 2017 [cited by applicant]
US 9727723B1 · Kondaveeti et al. · 2017 [cited by applicant]
US 9954884B2 · Hassell et al. · 2018 [cited by applicant]
US 10237298B1 · Nguyen et al. · 2019 [cited by applicant]
US 10268821B2 · Stockdale et al. · 2019 [cited by applicant]
US 10320813B1 · Ahmed · 2019 [cited by examiner]
US 10382473B1 · Ashkenazy · 2019 [cited by examiner]
US 10419466B2 · Ferguson et al. · 2019 [cited by applicant]
US 10516693B2 · Stockdale et al. · 2019 [cited by applicant]
US 10659335B1 · Morris · 2020 [cited by examiner]
US 10701093B2 · Dean et al. · 2020 [cited by applicant]
US 10754959B1 · Rajasooriya · 2020 [cited by examiner]
US 10812521B1 · Sharifi Mehr · 2020 [cited by examiner]
US 10848515B1 · Pokhrel · 2020 [cited by examiner]
US 11228612B2 · Vajipayajula · 2022 [cited by examiner]
US 20020174217A1 · Anderson et al. · 2002 [cited by applicant]
US 20020186698A1 · Ceniza · 2002 [cited by applicant]
US 20030051026A1 · Carter · 2003 [cited by examiner]
US 20030070003A1 · Chong et al. · 2003 [cited by applicant]
US 20040083129A1 · Herz · 2004 [cited by applicant]
US 20040167893A1 · Matsunaga et al. · 2004 [cited by applicant]
US 20050065754A1 · Schaf et al. · 2005 [cited by applicant]
US 20050193430A1 · Cohen · 2005 [cited by examiner]
US 20060021044A1 · Cook · 2006 [cited by examiner]
US 20060021046A1 · Cook · 2006 [cited by examiner]
US 20060021047A1 · Cook · 2006 [cited by examiner]
US 20060021048A1 · Cook · 2006 [cited by examiner]
US 20060021050A1 · Cook · 2006 [cited by examiner]
US 20060191010A1 · Benjamin · 2006 [cited by examiner]
US 20070118909A1 · Hertzog et al. · 2007 [cited by applicant]
US 20070294187A1 · Scherrer · 2007 [cited by applicant]
US 20080005137A1 · Surendran et al. · 2008 [cited by applicant]
US 20080077358A1 · Marvasti · 2008 [cited by applicant]
US 20080109730A1 · Coffman et al. · 2008 [cited by applicant]
US 20090007270A1 · Futoransky · 2009 [cited by examiner]
US 20090077666A1 · Chen · 2009 [cited by examiner]
US 20090106174A1 · Battisha et al. · 2009 [cited by applicant]
US 20090254971A1 · Herz et al. · 2009 [cited by applicant]
US 20100009357A1 · Nevins et al. · 2010 [cited by applicant]
US 20100058456A1 · Jajodia · 2010 [cited by examiner]
US 20100095374A1 · Gillum et al. · 2010 [cited by applicant]
US 20100107254A1 · Eiland et al. · 2010 [cited by applicant]
US 20100125908A1 · Kudo · 2010 [cited by applicant]
US 20100138925A1 · Barai · 2010 [cited by examiner]
US 20100192195A1 · Dunagan · 2010 [cited by examiner]
US 20100235908A1 · Eynon et al. · 2010 [cited by applicant]
US 20100299292A1 · Collazo · 2010 [cited by applicant]
US 20110093428A1 · Wisse · 2011 [cited by applicant]
US 20110213742A1 · Lemmond et al. · 2011 [cited by applicant]
US 20110261710A1 · Chen et al. · 2011 [cited by applicant]
US 20120096549A1 · Amini et al. · 2012 [cited by applicant]
US 20120137367A1 · Dupont et al. · 2012 [cited by applicant]
US 20120209575A1 · Barbat et al. · 2012 [cited by applicant]
US 20120210388A1 · Kolishchak · 2012 [cited by applicant]
US 20120284791A1 · Miller et al. · 2012 [cited by applicant]
US 20120304288A1 · Wright et al. · 2012 [cited by applicant]
US 20130091539A1 · Khurana et al. · 2013 [cited by applicant]
US 20130198119A1 · Eberhardt, III et al. · 2013 [cited by applicant]
US 20130198840A1 · Drissi et al. · 2013 [cited by applicant]
US 20130254885A1 · Devost · 2013 [cited by applicant]
US 20130318616A1 · Christodorescu · 2013 [cited by examiner]
US 20140007237A1 · Wright et al. · 2014 [cited by applicant]
US 20140007241A1 · Gula · 2014 [cited by examiner]
US 20140074762A1 · Campbell · 2014 [cited by applicant]
US 20140165207A1 · Engel et al. · 2014 [cited by applicant]
US 20140215618A1 · Amit · 2014 [cited by applicant]
US 20140325643A1 · Bart et al. · 2014 [cited by applicant]
US 20150058993A1 · Choi · 2015 [cited by examiner]
US 20150067835A1 · Chari et al. · 2015 [cited by applicant]
US 20150081431A1 · Akahoshi et al. · 2015 [cited by applicant]
US 20150161394A1 · Ferragut et al. · 2015 [cited by applicant]
US 20150163121A1 · Mahaffey et al. · 2015 [cited by applicant]
US 20150172300A1 · Cochenour · 2015 [cited by applicant]
US 20150180893A1 · Im et al. · 2015 [cited by applicant]
US 20150213358A1 · Shelton et al. · 2015 [cited by applicant]
US 20150286819A1 · Coden et al. · 2015 [cited by applicant]
US 20150310195A1 · Bailor et al. · 2015 [cited by applicant]
US 20150319185A1 · Kirti et al. · 2015 [cited by applicant]
US 20150341379A1 · Lefebvre et al. · 2015 [cited by applicant]
US 20150363699A1 · Nikovski · 2015 [cited by applicant]
US 20150379110A1 · Marvasti et al. · 2015 [cited by applicant]
US 20150381649A1 · Schultz · 2015 [cited by examiner]
US 20160062950A1 · Brodersen et al. · 2016 [cited by applicant]
US 20160078365A1 · Baumard · 2016 [cited by applicant]
US 20160149941A1 · Thakur et al. · 2016 [cited by applicant]
US 20160164902A1 · Moore · 2016 [cited by applicant]
US 20160173509A1 · Ray et al. · 2016 [cited by applicant]
US 20160205122A1 · Bassett · 2016 [cited by examiner]
US 20160241576A1 · Rathod et al. · 2016 [cited by applicant]
US 20160352768A1 · Lefebvre et al. · 2016 [cited by applicant]
US 20160359695A1 · Yadav et al. · 2016 [cited by applicant]
US 20160373476A1 · Dell'Anno et al. · 2016 [cited by applicant]
US 20170046519A1 · Cam · 2017 [cited by examiner]
US 20170048266A1 · Hovor · 2017 [cited by examiner]
US 20170054745A1 · Zhang et al. · 2017 [cited by applicant]
US 20170063907A1 · Muddu et al. · 2017 [cited by applicant]
US 20170063910A1 · Muddu et al. · 2017 [cited by applicant]
US 20170063911A1 · Muddu et al. · 2017 [cited by applicant]
US 20170169360A1 · Veeramachaneni et al. · 2017 [cited by applicant]
US 20170214701A1 · Hasan · 2017 [cited by examiner]
US 20170270422A1 · Sorakado · 2017 [cited by applicant]
US 20180027006A1 · Zimmermann et al. · 2018 [cited by applicant]
US 20180167402A1 · Scheidler et al. · 2018 [cited by applicant]
US 20180219901A1 · Gorodissky · 2018 [cited by examiner]
US 20180288073A1 · Hopper · 2018 [cited by examiner]
US 20180295154A1 · Crabtree · 2018 [cited by examiner]
US 20180359272A1 · Mizrachi · 2018 [cited by examiner]
US 20180367549A1 · Jang · 2018 [cited by examiner]
US 20190036948A1 · Appel et al. · 2019 [cited by applicant]
US 20190044963A1 · Rajasekharan et al. · 2019 [cited by applicant]
US 20190114245A1 · Mermoud · 2019 [cited by examiner]
US 20190149572A1 · Gorodissky · 2019 [cited by examiner]
US 20190182266A1 · Doron · 2019 [cited by examiner]
US 20190251260A1 · Stockdale et al. · 2019 [cited by applicant]
US 20190297096A1 · Ahmed · 2019 [cited by examiner]
US 20190342307A1 · Gamble · 2019 [cited by examiner]
US 20190347578A1 · Bolding · 2019 [cited by examiner]
US 20200067962A1 · Tan · 2020 [cited by examiner]
US 20200177615A1 · Grabois · 2020 [cited by examiner]
US 20200177617A1 · Hadar · 2020 [cited by examiner]
US 20200177618A1 · Hassanzadeh · 2020 [cited by examiner]
US 20200280575A1 · Dean et al. · 2020 [cited by applicant]
US 20200351295A1 · Nhlabatsi · 2020 [cited by examiner]
US 20200379079A1 · Dupray · 2020 [cited by examiner]
US 20200382543A1 · Hoopes · 2020 [cited by examiner]
US 20210012012A1 · Soroush · 2021 [cited by examiner]
US 20210014256A1 · Malhotra · 2021 [cited by examiner]
US 20210021629A1 · Dani · 2021 [cited by examiner]
US 20210092153A1 · Wei · 2021 [cited by examiner]
US 20210120027A1 · Dean et al. · 2021 [cited by applicant]
US 20210157919A1 · Stockdale et al. · 2021 [cited by applicant]
US 20210367962A1 · Kurowski · 2021 [cited by examiner]
US 20210409449A1 · Crabtree · 2021 [cited by examiner]
US 20220078210A1 · Crabtree · 2022 [cited by examiner]
US 20220086064A1 · Sivaraman · 2022 [cited by examiner]
US 20220360597A1 · Fellows · 2022 [cited by examiner]
EP 2922268A1 · 2015 [cited by applicant]
WO 2001031420A2 · 2001 [cited by applicant]
WO 2008121945A2 · 2008 [cited by applicant]
WO 2013053407A1 · 2013 [cited by applicant]
WO 2014088912A1 · 2014 [cited by applicant]
WO 2015027828A1 · 2015 [cited by applicant]
WO 2016020660A1 · 2016 [cited by applicant]
Abdallah Abbey Sebyala et al., “Active Platform Security through Intrusion Detection Using Naive Bayesian Network for Anomaly Detection,” Department of Electronic and Electrical Engineering, 5 pages, University College … [cited by applicant]
Marek Zachara et al., “Detecting Unusual User Behavior to Identify Hijacked Internet Auctions Accounts,” Lecture Notes in Computer Science, 2012, vol. 7465, Springer, Berlin, Heidelberg, Germany. [cited by applicant]
European Patent Office, Extended European Search Report for Application No. 20193124.3, Jan. 22, 2021, 11 pages., Germany. [cited by applicant]
Stephen Moskal et al., Cyber threat assessment via attack scenario simulation using an integrated adversary and network modeling approach, The Journal of Defense Modeling and Simulation: Applications, Methodology, Techn… [cited by applicant]
United Stats Patent and Trademark Office, Non-Final Office Action, Sep. 29, 2022, 87 pages. [cited by applicant]
Gharan, Shayan Oveis, “Lecture 11: Clustering and the Spectral Partitioning Algorithm” May 2, 2016. [cited by applicant]
Nikolystylfw, “Can Senseon beat Darktrace at its very own game with its ‘An I triangulation’ modern technology?” Dec. 22, 2018, nikolystylfw. [cited by applicant]
Lunden, Ingrid, “Senseon raises $6.4M to tackle cybersecurity threats with an AI ‘triangulation’ approach” Feb. 19, 2019, Tech Crunch. [cited by applicant]
Senseon Tech Ltd., “The State of Cyber Security SME Report 2019,” Jun. 3, 2019. [cited by applicant]
Senseon Tech Ltd., “Technology,” * please see the statement filed herewith. [cited by applicant]
Senseon Tech Ltd., “Senseon & You,” * please see the statement filed herewith. [cited by applicant]
Senseon Tech Ltd., “Technology Overview,” * please see the statement filed herewith. [cited by applicant]
Senseon Tech Ltd., “Senseon Enterprise,” * please see the statement filed herewith. [cited by applicant]
Senseon Tech Ltd., “Senseon Pro,” * please see the statement filed herewith. [cited by applicant]
Senseon Tech Ltd., “Senseon Reflex,” * please see the statement filed herewith. [cited by applicant]
Israeli Patent Offce, Notice of Deficiencies for Patent Aplication 276972 ; 4 pages, Aug. 22, 2021. [cited by applicant]
Moskal Stephen et al: “Context Model Fusion for Multistage Network Attack Simulation”, 2014 IEEE Military Communications Conference, IEEE, Oct. 6, 2014 (Oct. 6, 2014), pp. 158-163, XP032686457, DOI: 10.1109/MILCOM.2014.… [cited by applicant]
European Patent Office, Communication Pursuant to Article 94(3) EPC, 36 pp, dated Nov. 21, 2024. [cited by applicant]
Cited By (1)
US 12,452,287