IP Library › Granted Patent US 12,231,448
Granted Patent B2
US 12,231,448 · App. 17/681,658 · Granted Feb 18, 2025

Using graph enrichment to detect a potentially malicious access attempt

Inventors: Shay Chriba Sakazi (Beer Sheva, IL); Andrey Karpovsky (Kiryat Motzkin, IL); Amit Magen Medina (Netanya, IL); Tamer Salman (Haifa, IL)
Assignee: Microsoft Technology Licensing, LLC
H04L63/1425H04L63/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,231,448
App. No.
17/681,658
Filed
Feb 25, 2022
Granted
Feb 18, 2025
Kind
B2
Art Unit
2407
USPC
726/23
Abstract

Techniques are described herein that are capable of using graph enrichment to detect a potentially malicious access attempt. A graph that includes nodes and configuration-based links is generated. The nodes represent respective resources. Behavior-based links are added to the graph based at least in part on traffic logs associated with at least a subset of the resources. An attempt to create a new behavior-based link is identified. A probability of the new behavior-based link being created in the graph is determined. The probability is based at least in part on the configuration-based links and the behavior-based links. The new behavior-based link is identified as a potentially malicious link based at least in part on the probability being less than or equal to a threshold probability. A security action is performed based at least in part on the new behavior-based link being identified as a potentially malicious link.

Claims (89)

1. A system to use graph enrichment to detect a potentially malicious access attempt, the system comprising:

a memory; and

a processing system coupled to the memory, the processing system configured to:

generate a graph that includes at least a subset of a plurality of nodes and a plurality of configuration-based links, the plurality of nodes representing a plurality of respective resources in a network-based system, each configuration-based link representing a hierarchical relationship between a respective pair of the nodes such that a first node in the pair belongs to a second node in the pair;

add a plurality of behavior-based links to the graph based at least in part on traffic logs associated with at least a subset of the resources, each behavior-based link representing at least one of the following:

an access-based relationship between a respective pair of the nodes, which is based at least in part on a first node in the pair accessing a second node in the pair; or

an association-based relationship between a respective pair of nodes, which is based at least in part on a first node in the pair having a relationship with a third node and which is further based at least in part on the third node sharing a link with a second node in the pair;

identify an attempt to create a new behavior-based link between a designated first node of the plurality of nodes and a designated second node of the plurality of nodes, wherein the designated first node attempts to access the designated second node;

determine a probability of the new behavior-based link being created in the graph, wherein the probability is based at least in part on the plurality of configuration-based links and the plurality of behavior-based links;

identify the new behavior-based link as a potentially malicious link based at least in part on the probability of the new behavior-based link being created in the graph being less than or equal to a threshold probability; and

perform a security action based at least in part on the new behavior-based link being identified as a potentially malicious link, the security action configured to increase security of the network-based system.

2. The system of claim 1 , wherein an identified behavior-based link of the plurality of behavior-based links represents an access-based relationship between an identified pair of nodes, which is based at least in part on a first node in the identified pair accessing a second node in the identified pair.

3. The system of claim 1 , wherein an identified behavior-based link of the plurality of behavior-based links represents an association-based relationship between an identified pair of nodes, which is based at least in part on a first node in the identified pair having a relationship with a third node and which is further based at least in part on the third node sharing a link with a second node in the identified pair.

4. The system of claim 1 , wherein the processing system is configured to:

determine a plurality of link probabilities of the plurality of respective behavior-based links being created in the graph, wherein each link probability is based at least in part on the configuration-based links, the other behavior-based links in the plurality of behavior-based links, and the new behavior-based link; and

determine the probability of the new behavior-based link being created in the graph based at least in part on the plurality of link probabilities of the plurality of respective behavior-based links.

5. The system of claim 1 , wherein the processing system is further configured to:

after the plurality of behavior-based links are added to the graph, add a new node to the plurality of nodes in real-time to represent a new resource as a result of discovery of the new resource;

add at least one new configuration-based link to the graph, each new configuration-based link representing a hierarchical relationship between the new node and another respective node of the plurality of nodes; and

add at least one new behavior-based link to the plurality of behavior-based links, each new behavior-based link being between the new node and another respective node of the plurality of nodes.

6. The system of claim 1 , wherein the processing system is configured to:

determine that a motif in the graph is associated with malicious activity;

determine that the motif includes the new behavior-based link; and

identify the new behavior-based link as a potentially malicious link further based at least in part on the motif, which is associated with the malicious activity, including the new behavior-based link.

7. The system of claim 1 , wherein the processing system is configured to:

provide an alert to an entity associated with the network-based system based at least in part on the new behavior-based link being identified as a potentially malicious link, the alert indicating that the new behavior-based link between the designated first node and the designated second node is potentially malicious.

8. The system of claim 1 , wherein the processing system is configured to:

not allow creation of the new behavior-based link between the designated first node and the designated second node based at least in part on the new behavior-based link being identified as a potentially malicious link.

9. The system of claim 1 , wherein the processing system is configured to:

determine that the new behavior-based link between the designated first node and the designated second node is created; and

disconnect the new behavior-based link between the designated first node and the designated second node based at least in part on the new behavior-based link being identified as a potentially malicious link.

10. The system of claim 1 , wherein the processing system is configured to:

compare the probability of the new behavior-based link being created in the graph to a second threshold probability that is less than the first threshold probability; and

perform either a first action or a second action depending on whether the probability of the new behavior-based link being created in the graph is less than or equal to the second threshold probability, including:

perform the first action as a result of the probability of the new behavior-based link being created in the graph being greater than the second threshold probability, the first action including providing an alert to an entity associated with the network-based system, the alert indicating that the new behavior-based link between the designated first node and the designated second node is potentially malicious; or

perform the second action as a result of the probability of the new behavior-based link being created in the graph being less than or equal to the second threshold probability, the second action including not allowing creation of the new behavior-based link between the designated first node and the designated second node.

11. The system of claim 1 , wherein the processing system is configured to:

determine a confidence in an accuracy of the probability of the new behavior-based link being created in the graph;

compare the confidence to a confidence threshold; and

perform the security action further based at least in part on the confidence being greater than or equal to the confidence threshold.

12. A method of using graph enrichment to detect a potentially malicious access attempt, the method implemented by a computing system that is included in a network-based system, the method comprising:

generating a graph that includes at least a subset of a plurality of nodes and a plurality of configuration-based links, the plurality of nodes representing a plurality of respective resources in the network-based system, each configuration-based link representing a hierarchical relationship between a respective pair of the nodes such that a first node in the pair belongs to a second node in the pair;

adding a plurality of behavior-based links to the graph based at least in part on traffic logs associated with at least a subset of the resources, each behavior-based link representing at least one of the following:

an access-based relationship between a respective pair of the nodes, which is based at least in part on a first node in the pair accessing a second node in the pair; or

an association-based relationship between a respective pair of nodes, which is based at least in part on a first node in the pair having a relationship with a third node and which is further based at least in part on the third node sharing a link with a second node in the pair;

identifying an attempt to create a new behavior-based link between a designated first node of the plurality of nodes and a designated second node of the plurality of nodes, wherein the designated first node attempts to access the designated second node;

determining a probability of the new behavior-based link being created in the graph, wherein the probability is based at least in part on the plurality of configuration-based links and the plurality of behavior-based links;

identifying the new behavior-based link as a potentially malicious link based at least in part on the probability of the new behavior-based link being created in the graph being less than or equal to a threshold probability; and

performing a security action based at least in part on the new behavior-based link being identified as a potentially malicious link, the security action configured to increase security of the network-based system.

13. The method of claim 12 , further comprising:

determining that a motif in the graph is associated with malicious activity; and

determining that the motif includes the new behavior-based link;

wherein identifying the new behavior-based link as a potentially malicious link comprises:

identifying the new behavior-based link as a potentially malicious link further based at least in part on the motif, which is associated with the malicious activity, including the new behavior-based link.

14. The method of claim 12 , wherein performing the security action comprises at least one of the following:

providing an alert to an entity associated with the network-based system based at least in part on the new behavior-based link being identified as a potentially malicious link, the alert indicating that the new behavior-based link between the designated first node and the designated second node is potentially malicious; or

not allowing creation of the new behavior-based link between the designated first node and the designated second node based at least in part on the new behavior-based link being identified as a potentially malicious link.

15. The method of claim 12 , wherein identifying the attempt to create the new behavior-based link comprises:

determining that the new behavior-based link between the designated first node and the designated second node is created; and

wherein performing the security action comprises:

disconnecting the new behavior-based link between the designated first node and the designated second node based at least in part on the new behavior-based link being identified as a potentially malicious link.

16. The method of claim 12 , further comprising:

comparing the probability of the new behavior-based link being created in the graph to a second threshold probability that is less than the first threshold probability;

wherein performing the security action comprises:

performing either a first action or a second action depending on whether the probability of the new behavior-based link being created in the graph is less than or equal to the second threshold probability, including:

performing the first action as a result of the probability of the new behavior-based link being created in the graph being greater than the second threshold probability, the first action including providing an alert to an entity associated with the network-based system, the alert indicating that the new behavior-based link between the designated first node and the designated second node is potentially malicious; or

performing the second action as a result of the probability of the new behavior-based link being created in the graph being less than or equal to the second threshold probability, the second action including not allowing creation of the new behavior-based link between the designated first node and the designated second node.

17. The method of claim 12 , further comprising:

determining a sensitivity of data associated with the designated second node; and

comparing the sensitivity to a sensitivity threshold;

wherein performing the security action comprises:

performing the security action further based at least in part on the sensitivity being greater than or equal to the sensitivity threshold.

18. The method of claim 12 , further comprising:

determining a number of the plurality of resources whose performance is to be reduced by creation of the new behavior-based link;

wherein performing the security action comprises:

providing a notification to an entity associated with the network-based system based at least in part on the new behavior-based link being identified as a potentially malicious link, the notification indicating the number of the plurality of resources whose performance is to be reduced by the creation of the new behavior-based link.

19. The method of claim 12 , further comprising:

determining an extent to which performance of the plurality of resources is to be reduced by creation of the new behavior-based link;

wherein performing the security action comprises:

providing a notification to an entity associated with the network-based system based at least in part on the new behavior-based link being identified as a potentially malicious link, the notification indicating the extent to which the performance of the plurality of resources is to be reduced by the creation of the new behavior-based link.

20. A computer program product comprising a computer-readable storage medium having instructions recorded thereon for enabling a processor-based system to perform operations, which are configured to use graph enrichment to detect a potentially malicious access attempt, the operations comprising:

generating a graph that includes at least a subset of a plurality of nodes and a plurality of configuration-based links, the plurality of nodes representing a plurality of respective resources in a network-based system, each configuration-based link representing a hierarchical relationship between a respective pair of the nodes such that a first node in the pair belongs to a second node in the pair;

adding a plurality of behavior-based links to the graph based at least in part on traffic logs associated with at least a subset of the resources, each behavior-based link representing at least one of the following:

an access-based relationship between a respective pair of the nodes, which is based at least in part on a first node in the pair accessing a second node in the pair; or

an association-based relationship between a respective pair of nodes, which is based at least in part on a first node in the pair having a relationship with a third node and which is further based at least in part on the third node sharing a link with a second node in the pair;

identifying an attempt to create a new behavior-based link between a designated first node of the plurality of nodes and a designated second node of the plurality of nodes, wherein the designated first node attempts to access the designated second node;

determining a probability of the new behavior-based link being created in the graph, wherein the probability is based at least in part on the plurality of configuration-based links and the plurality of behavior-based links;

identifying the new behavior-based link as a potentially malicious link based at least in part on the probability of the new behavior-based link being created in the graph being less than or equal to a threshold probability; and

performing a security action based at least in part on the new behavior-based link being identified as a potentially malicious link, the security action configured to increase security of the network-based system.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 1, 2022
From: MEDINA, AMIT MAGEN
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 059135/0934 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 25, 2022
From: SAKAZI, SHAY CHRIBA; KARPOVSKY, ANDREY; MEDINA, AMIT MAGEN; SALMAN, TAMER
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 059108/0567 →
Continuity (1)
Related Publication 20230275913A1 · Aug 31, 2023
References Cited (199)
US 7509344B1 · Kamvar · 2009 [cited by examiner]
US 7941857B2 · Baum-Waidner · 2011 [cited by examiner]
US 8813234B1 · Bowers · 2014 [cited by examiner]
US 8813236B1 · Saha · 2014 [cited by examiner]
US 8881288B1 · Levy · 2014 [cited by examiner]
US 9083712B2 · Porras · 2015 [cited by examiner]
US 9100430B1 · Seiver · 2015 [cited by examiner]
US 9183387B1 · Altman · 2015 [cited by examiner]
US 9225730B1 · Brezinski · 2015 [cited by examiner]
US 9231962B1 · Yen · 2016 [cited by examiner]
US 9261898B1 · Allen · 2016 [cited by examiner]
US 9356941B1 · Kislyuk · 2016 [cited by examiner]
US 9516053B1 · Muddu · 2016 [cited by examiner]
US 9537884B1 · Raugas · 2017 [cited by examiner]
US 9710646B1 · Zhang · 2017 [cited by examiner]
US 9787640B1 · Xie · 2017 [cited by examiner]
US 9916448B1 · Zhang · 2018 [cited by examiner]
US 9967265B1 · Peer · 2018 [cited by examiner]
US 9992219B1 · Hamlet · 2018 [cited by examiner]
US 10003985B1 · Holland · 2018 [cited by examiner]
US 10121000B1 · Rivlin · 2018 [cited by examiner]
US 10129276B1 · Raviv · 2018 [cited by examiner]
US 10237283B2 · Zhang · 2019 [cited by examiner]
US 10291645B1 · Frantzen · 2019 [cited by examiner]
US 10419469B1 · Singh · 2019 [cited by examiner]
US 10742670B1 · Kayyoor · 2020 [cited by examiner]
US 10848515B1 · Pokhrel · 2020 [cited by examiner]
US 10958667B1 · Maida · 2021 [cited by examiner]
US 11032303B1 · Efstathopoulos · 2021 [cited by examiner]
US 11055317B2 · Dadkhahi · 2021 [cited by examiner]
US 11063969B1 · Luo · 2021 [cited by examiner]
US 11171972B1 · Brody · 2021 [cited by examiner]
US 11201890B1 · Coull · 2021 [cited by examiner]
US 11233806B2 · Kondaveeti · 2022 [cited by examiner]
US 11290476B1 · Ochsner · 2022 [cited by examiner]
US 11310342B1 · Frey · 2022 [cited by examiner]
US 11367323B1 · Shahidzadeh · 2022 [cited by examiner]
US 11399039B2 · Rubin · 2022 [cited by examiner]
US 11457031B1 · Bisht · 2022 [cited by examiner]
US 11531780B2 · Kundu · 2022 [cited by examiner]
US 11671436B1 · Xu · 2023 [cited by examiner]
US 11770387B1 · Shivamoggi · 2023 [cited by examiner]
US 11792284B1 · Nanduri · 2023 [cited by examiner]
US 11936558B1 · Qian · 2024 [cited by examiner]
US 11941112B2 · Boutnaru · 2024 [cited by examiner]
US 11946766B1 · Volkerink · 2024 [cited by examiner]
US 12118077B2 · Manevitz · 2024 [cited by examiner]
US 20050262470A1 · Gavrilov · 2005 [cited by examiner]
US 20060285543A1 · Bonsma · 2006 [cited by examiner]
US 20070041345A1 · Yarvis · 2007 [cited by examiner]
US 20080044028A1 · Sun · 2008 [cited by examiner]
US 20080313117A1 · Galvin · 2008 [cited by examiner]
US 20090157902A1 · Saffre · 2009 [cited by examiner]
US 20100192195A1 · Dunagan · 2010 [cited by examiner]
US 20100246445A1 · Scarlatti · 2010 [cited by examiner]
US 20100268719A1 · Cormode · 2010 [cited by examiner]
US 20110061104A1 · Sarraute Yamada · 2011 [cited by examiner]
US 20110087924A1 · Kandula · 2011 [cited by examiner]
US 20110213801A1 · He · 2011 [cited by examiner]
US 20120051239A1 · Thai · 2012 [cited by examiner]
US 20130114452A1 · Raoul · 2013 [cited by examiner]
US 20130318616A1 · Christodorescu · 2013 [cited by examiner]
US 20140075318A1 · Cheng · 2014 [cited by examiner]
US 20140136838A1 · Mossbarger · 2014 [cited by examiner]
US 20140237570A1 · Shishkov · 2014 [cited by examiner]
US 20150047026A1 · Neil · 2015 [cited by examiner]
US 20150067836A1 · Billa · 2015 [cited by examiner]
US 20150188941A1 · Boshmaf · 2015 [cited by examiner]
US 20150244734A1 · Olson · 2015 [cited by examiner]
US 20150350038A1 · Mohan · 2015 [cited by examiner]
US 20150363702A1 · Baum · 2015 [cited by examiner]
US 20160099953A1 · Hebert · 2016 [cited by examiner]
US 20160125094A1 · Li · 2016 [cited by examiner]
US 20160219066A1 · Vasseur · 2016 [cited by examiner]
US 20160277423A1 · Apostolescu · 2016 [cited by examiner]
US 20160301709A1 · Hassanzadeh · 2016 [cited by examiner]
US 20170019251A1 · Jain · 2017 [cited by examiner]
US 20170032274A1 · Yu · 2017 [cited by examiner]
US 20170104774A1 · Vasseur · 2017 [cited by examiner]
US 20170147815A1 · Pedersen · 2017 [cited by examiner]
US 20170149814A1 · Chen · 2017 [cited by examiner]
US 20170154445A1 · Maruhashi · 2017 [cited by examiner]
US 20170279827A1 · Savalle · 2017 [cited by examiner]
US 20170279829A1 · Vasseur · 2017 [cited by examiner]
US 20170279830A1 · Mermoud · 2017 [cited by examiner]
US 20170279832A1 · Di Pietro · 2017 [cited by examiner]
US 20170279847A1 · Dasgupta · 2017 [cited by examiner]
US 20170316342A1 · Franc · 2017 [cited by examiner]
US 20170318034A1 · Holland · 2017 [cited by examiner]
US 20170346839A1 · Peppe · 2017 [cited by examiner]
US 20170364450A1 · Struttmann · 2017 [cited by examiner]
US 20170374575A1 · Kahtava · 2017 [cited by examiner]
US 20180032724A1 · Tang · 2018 [cited by examiner]
US 20180048661A1 · Bird · 2018 [cited by examiner]
US 20180048662A1 · Jang · 2018 [cited by examiner]
US 20180083995A1 · Sheth · 2018 [cited by examiner]
US 20180097833A1 · Saito · 2018 [cited by examiner]
US 20180159890A1 · Warnick · 2018 [cited by examiner]
US 20180167307A1 · Barry · 2018 [cited by examiner]
US 20180219888A1 · Apostolopoulos · 2018 [cited by examiner]
US 20180241762A1 · Savalle · 2018 [cited by examiner]
US 20180262327A1 · Jain · 2018 [cited by examiner]
US 20180262527A1 · Jain · 2018 [cited by examiner]
US 20180343272A1 · Khalil · 2018 [cited by examiner]
US 20180367548A1 · Stokes, III · 2018 [cited by examiner]
US 20180367557A1 · Brown · 2018 [cited by examiner]
US 20190050562A1 · Rhee · 2019 [cited by examiner]
US 20190052663A1 · Lee · 2019 [cited by examiner]
US 20190104121A1 · Khandani · 2019 [cited by examiner]
US 20190132344A1 · Lem · 2019 [cited by examiner]
US 20190149572A1 · Gorodissky · 2019 [cited by examiner]
US 20190182273A1 · Walsh · 2019 [cited by examiner]
US 20190230099A1 · Mestha · 2019 [cited by examiner]
US 20190253323A1 · Mohr · 2019 [cited by examiner]
US 20190253442A1 · Brabec · 2019 [cited by examiner]
US 20190260775A1 · Bartos · 2019 [cited by examiner]
US 20190311136A1 · Pai · 2019 [cited by examiner]
US 20190312898A1 · Verma · 2019 [cited by examiner]
US 20190370813A1 · Bravick · 2019 [cited by examiner]
US 20190394225A1 · Vajipayajula · 2019 [cited by examiner]
US 20200007562A1 · Aboualy · 2020 [cited by examiner]
US 20200092316A1 · Tang · 2020 [cited by examiner]
US 20200099704A1 · Lee · 2020 [cited by examiner]
US 20200099708A1 · Mathews · 2020 [cited by examiner]
US 20200120115A1 · Bird · 2020 [cited by examiner]
US 20200137083A1 · Chen · 2020 [cited by examiner]
US 20200145442A1 · Jang · 2020 [cited by examiner]
US 20200167785A1 · Kursun · 2020 [cited by examiner]
US 20200167786A1 · Kursun · 2020 [cited by examiner]
US 20200169483A1 · Kursun · 2020 [cited by examiner]
US 20200177466A1 · Rossi · 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 20200195673A1 · Lee · 2020 [cited by examiner]
US 20200220892A1 · Gibson · 2020 [cited by examiner]
US 20200233864A1 · Jin · 2020 [cited by examiner]
US 20200244673A1 · Stockdale · 2020 [cited by examiner]
US 20200280508A1 · Davey · 2020 [cited by examiner]
US 20200301972A1 · Wang · 2020 [cited by examiner]
US 20200304462A1 · Kopp · 2020 [cited by examiner]
US 20200320106A1 · Goldfarb · 2020 [cited by examiner]
US 20200351237A1 · Chakkirala · 2020 [cited by examiner]
US 20200387819A1 · Rogynskyy · 2020 [cited by examiner]
US 20200412763A1 · Mercian · 2020 [cited by examiner]
US 20210012012A1 · Soroush · 2021 [cited by examiner]
US 20210034737A1 · Khan · 2021 [cited by examiner]
US 20210067558A1 · Ni · 2021 [cited by examiner]
US 20210133331A1 · Lipkis · 2021 [cited by examiner]
US 20210144159A1 · Sanghvi · 2021 [cited by examiner]
US 20210158149A1 · Zhang · 2021 [cited by examiner]
US 20210194907A1 · Bertiger · 2021 [cited by examiner]
US 20210194924A1 · Heinemeyer · 2021 [cited by examiner]
US 20210217019A1 · Huang · 2021 [cited by examiner]
US 20210218770A1 · Ben-Yosef · 2021 [cited by examiner]
US 20210243208A1 · Rubin · 2021 [cited by examiner]
US 20210243212A1 · Bowman · 2021 [cited by examiner]
US 20210248443A1 · Shu · 2021 [cited by examiner]
US 20210258334A1 · Sayag · 2021 [cited by examiner]
US 20210273953A1 · Fellows · 2021 [cited by examiner]
US 20210279284A1 · Yu · 2021 [cited by examiner]
US 20210281396A1 · Yu · 2021 [cited by examiner]
US 20210281591A1 · Furtak · 2021 [cited by examiner]
US 20210314341A1 · Moskovich · 2021 [cited by examiner]
US 20210350248A1 · Rogers · 2021 [cited by examiner]
US 20210400059A1 · Hong · 2021 [cited by examiner]
US 20210406365A1 · Neil et al. · 2021 [cited by applicant]
US 20220014534A1 · Basovskiy · 2022 [cited by examiner]
US 20220030010A1 · Shah · 2022 [cited by examiner]
US 20220070202A1 · Busany · 2022 [cited by examiner]
US 20220131894A1 · Hassanzadeh · 2022 [cited by examiner]
US 20220141235A1 · Muthuswamy · 2022 [cited by examiner]
US 20220191230A1 · Morgan · 2022 [cited by examiner]
US 20220197981A1 · Marson · 2022 [cited by examiner]
US 20220198045A1 · Marson · 2022 [cited by examiner]
US 20220201014A1 · Saha · 2022 [cited by examiner]
US 20220224724A1 · Bazalgette · 2022 [cited by examiner]
US 20220303291A1 · Baldini Das Neves · 2022 [cited by examiner]
US 20220337619A1 · Ohta · 2022 [cited by examiner]
US 20220394049A1 · Abrahamian · 2022 [cited by examiner]
US 20220407889A1 · Narigapalli · 2022 [cited by examiner]
US 20220407891A1 · Albanese · 2022 [cited by examiner]
US 20220414228A1 · Difonzo · 2022 [cited by examiner]
US 20220414664A1 · Liu · 2022 [cited by examiner]
US 20230007023A1 · Andrabi · 2023 [cited by examiner]
US 20230034910A1 · Engelberg · 2023 [cited by examiner]
US 20230052827A1 · Araujo · 2023 [cited by examiner]
US 20230053044A1 · Wang · 2023 [cited by examiner]
US 20230053182A1 · Bertiger · 2023 [cited by examiner]
US 20230065398A1 · Purdy · 2023 [cited by examiner]
US 20230111177A1 · Noel · 2023 [cited by examiner]
US 20230164059A1 · Dawani · 2023 [cited by examiner]
US 20230177355A1 · Narayanam · 2023 [cited by examiner]
US 20230269195A1 · Arumugam · 2023 [cited by examiner]
US 20230275912A1 · Shahul Hameed · 2023 [cited by examiner]
US 20230308263A1 · Eldefrawy · 2023 [cited by examiner]
US 20230422039A1 · Saha · 2023 [cited by examiner]
US 20240064014A9 · Maim · 2024 [cited by examiner]
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US23/011092”, Mailed Date: Apr. 25, 2023, 16 Pages. [cited by applicant]
Cited By (2)
US 12,683,989 US 12,693,881