This application is a non-provisional of U.S. Provisional Application No. 62/172,251, entitled SYSTEM AND METHOD FOR CREATION, DEPLOYMENT AND MANAGEMENT OF AUGMENTED ATTACKER MAP, and filed on Jun. 8, 2015 by inventors Shlomo Touboul, Hanan Levin, Stephane Roubach, Assaf Mischari, Itai Ben David, Itay Avraham, Adi Ozer, Chen Kazaz, Ofer Israeli, Olga Vingurt, Liad Gareh, Israel Grimberg, Cobby Cohen and Sharon Sultan, the contents of which are hereby incorporated herein in their entirety.
This application is a non-provisional of U.S. Provisional Application No. 62/172,253, entitled SYSTEM AND METHOD FOR MULTI-LEVEL DECEPTION MANAGEMENT AND DECEPTION SYSTEM FOR MALICIOUS ACTIONS IN A COMPUTER NETWORK, and filed on Jun. 8, 2015 by inventors Shlomo Touboul, Hanan Levin, Stephane Roubach, Assaf Mischari, Itai Ben David, Itay Avraham, Adi Ozer, Chen Kazaz, Ofer Israeli, Olga Vingurt, Liad Gareh, Israel Grimberg, Cobby Cohen and Sharon Sultan, the contents of which are hereby incorporated herein in their entirety.
This application is a non-provisional of U.S. Provisional Application No. 62/172,255, entitled METHODS AND SYSTEMS TO DETECT, PREDICT AND/OR PREVENT AN ATTACKER′S NEXT ACTION IN A COMPROMISED NETWORK, and filed on Jun. 8, 2015 by inventors Shlomo Touboul, Hanan Levin, Stephane Roubach, Assaf Mischari, Itai Ben David, Itay Avraham, Adi Ozer, Chen Kazaz, Ofer Israeli, Olga Vingurt, Liad Gareh, Israel Grimberg, Cobby Cohen and Sharon Sultan, the contents of which are hereby incorporated herein in their entirety.
This application is a non-provisional of U.S. Provisional Application No. 62/172,259, entitled MANAGING DYNAMIC DECEPTIVE ENVIRONMENTS, and filed on Jun. 8, 2015 by inventors Shlomo Touboul, Hanan Levin, Stephane Roubach, Assaf Mischari, Itai Ben David, Itay Avraham, Adi Ozer, Chen Kazaz, Ofer Israeli, Olga Vingurt, Liad Gareh, Israel Grimberg, Cobby Cohen and Sharon Sultan, the contents of which are hereby incorporated herein in their entirety.
This application is a non-provisional of U.S. Provisional Application No. 62/172,261, entitled SYSTEMS AND METHODS FOR AUTOMATICALLY GENERATING NETWORK ENTITY GROUPS BASED ON ATTACK PARAMETERS AND/OR ASSIGNMENT OF AUTOMATICALLY GENERATED SECURITY POLICIES, and filed on Jun. 8, 2015 by inventors Shlomo Touboul, Hanan Levin, Stephane Roubach, Assaf Mischari, Itai Ben David, Itay Avraham, Adi Ozer, Chen Kazaz, Ofer Israeli, Olga Vingurt, Liad Gareh, Israel Grimberg, Cobby Cohen and Sharon Sultan, the contents of which are hereby incorporated herein in their entirety.
The present invention relates to cyber security, and in particular to computer network surveillance.
Reference is made to
Access to computers 110 and servers 120 in network 100 may optionally be governed by an access governor 150, such as a directory service, that authorizes users to access computers 110 and servers 120 based on “credentials” and other methods of authentication. Access governor 150 may be a name directory, such as ACTIVE DIRECTORY® developed by Microsoft Corporation of Redmond, Wash., for WINDOWS® environments. Background information about ACTIVE DIRECTORY is available at Wikipedia. Other access governors for WINDOWS and non-WINDOWS environments include inter alia Lightweight Directory Access Protocol (LDAP), Remote Authentication Dial-In User Service (RADIUS), and Apple Filing Protocol (AFP), formerly APPLETALK®, developed by Apple Inc. of Cupertino, Calif. Background information about LDAP, RADIUS and AFP is available at Wikipedia.
Access governor 150 may be one or more local machine access controllers. For networks that do not include an access governor, authentication may be performed by other servers 120. Alternatively, in lieu of access governor 150, resources of network 100 determine their local access rights.
Credentials for accessing computers 110 and servers 120 include inter alia server account credentials such as <address> <username> <password> for an FTP server, a database server, or an SSH server. Credentials for accessing computers 110 and servers 120 also include user login credentials <username> <password>, or <username><ticket>, where “ticket” is an authentication ticket, such as a ticket for the Kerberos authentication protocol or NTLM hash used by Microsoft Corp., or login credentials via certificates or via another method of authentication. Background information about the Kerberos protocol and LM hashes is available at Wikipedia.
Access governor 150 may maintain a directory of computers 110, servers 120 and their users. Access governor 150 authorizes users and computers, assigns and enforces security policies, and installs and updates software.
Computers 110 may run a local or remote security service, which is an operating system process that verifies users logging in to computers, to other single sign-on systems, and to other credential storage systems.
Network 100 may include a security information and event management (SIEM) server 160, which provides real-time analysis of security alerts generated by network hardware and applications. Background information about SIEM is available at Wikipedia.
Network 100 may include a domain name system (DNS) server 170, or such other name service system, for translating domain names to IP addresses. Background information about DNS is available at Wikipedia.
Network 100 may include a firewall 180 located within a gateway between enterprise network 100 and external internet 10. Firewall 180 controls incoming and outgoing traffic for network 100. Background information about firewalls is available at Wikipedia.
One of the most prominent threats that organizations face is a targeted attack; i.e., an individual or group of individuals that attacks the organization for a specific purpose, such as stealing data, using data and systems, modifying data and systems, and sabotaging data and systems. Targeted attacks are carried out in multiple stages, typically including inter alia reconnaissance, penetration, lateral movement and payload. Lateral movement involves orientation, movement and propagation, and includes establishing a foothold within the organization and expanding that foothold to additional systems within the organization.
In order to carry out the lateral movement stage, an attacker, whether a human being who is operating tools within the organization's network, or a tool with “learning” capabilities, learns information about the environment it is operating in, such as network topology, network devices and organization structure, learns “where can I go from my current location” and “how can I get there from my current location (privilege required)”, learns implemented security solutions, learns applications that he can leverage, and then operates in accordance with that data.
An advanced attacker may use different attack techniques to enter a corporate network and to move laterally within the network in order to obtain his resource goals. The advanced attacker may begin with a workstation, server or any other network entity to start his lateral movement. He uses different methods to enter the network, including inter alia social engineering, existing exploit and/or vulnerability, and a Trojan horse or any other malware allowing him to control a first node or nodes.
Once an attacker has taken control of a first node in a corporate network, he uses different advanced attack techniques for orientation and propagation and discovery of additional ways to reach other network nodes in the corporate network. Attacker movement from node to node is performed via an “attack vector”, which is an object discovered by the attacker, including inter alia an object in memory or storage of a first computer that may be used to access or discover a second computer.
Exemplary attack vectors include inter alia credentials of users with escalated privileges, existing share names on different servers and workstations, and details including address and credentials of an FTP server, an email server, a database server or an SSH server. Attack vectors are often available to an attacker because a user did not log off of his workstation, did not log out of an application, or did not clear his cache. E.g., if a user contacted a help desk and gave a help desk administrator remote access to his workstation, and if the help desk administrator did not properly log off from the remote access session to the users workstation, then the help desk access credentials may still be stored in the user's local cache and available to the attacker. Similarly, if the user accessed a server, e.g., an FTP server, then the FTP account login parameters may be stored in the user's local cache or profile and available to the attacker.
Attack vectors enable inter alia a move from workstation A→server B based on a shared server host name and its credentials, connection to a different workstation using local admin credentials that reside on a current workstation, and connection to an FTP server using specific access credentials.
Whereas IT “sees” the logical and physical network topology, an attacker that lands on a first network node “sees” attack vectors that depart from that node and move laterally to other nodes. The attacker can move to such nodes and then follow “attack paths” by successively discovering attack vectors from node to node.
When the attacker implements such a discovery process on all nodes in the network, he will be able to “see” all attack vectors of the corporate network and generate a “complete attack map”. Before the attacker discovers all attack vectors on network nodes and completes the discovery process, he generates a “current attack map” that is currently available to him.
An objective of the attacker is to discover an attack path that leads him to a target network node. The target may be a bank authorized server that is used by the corporation for ordering bank account transfers of money, it may be an FTP server that updates the image of all corporate points of sale, it may be a server or workstation that stores confidential information such as source code and secret formulas of the corporation, or it may be any other network nodes that are of value to the attacker and are his “attack goal nodes”.
When the attacker lands on the first node, but does not know how to reach the attack goal node, he generates a current attack map that leads to the attack goal node.
One method to defend against such attacks, termed “honeypots”, is to plant and monitor bait resources, with the objective that the attacker learn of their existence and then consume those bait resources, and to notify an administrator of the malicious activity. Background information about honeypots is available at Wikipedia.
Conventional honeypot systems operate by monitoring access to a supervised element in a computer network, the supervised element being a fake server or a fake service. Access monitoring generates many false alerts, caused by non-malicious access from automatic monitoring systems and by user mistakes. Conventional systems try to mitigate this problem by adding a level of interactivity to the honeypot, and by performing behavioral analysis of suspected malware if it has infected the honeypot itself.
Embodiments of the present invention enhance confidence levels in identifying an attacker, by luring him into multiple access attempts to different resources monitored by the system, or into a single access attempt that requires multiple actions.
There is thus provided in accordance with an embodiment of the present invention a system for two-factor network surveillance to detect attackers, including a management server within a network of resources in which users access the resources in the network based on credentials, including a deployment module planting one or more honeytokens in one or more of the resources in the network, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to access a second resource using decoy credentials, and wherein the deployment module plants a first honeytoken in a first resource, R1, used to access a second resource, R2, using first decoy credentials, and plants a second honeytoken in R2, used to access a third resource, R3, using second decoy credentials, and an alert module alerting that an attacker is intruding the network only in response to both (1) an attempt to access R2 using the first decoy credentials, and (2) a subsequent attempt to access R3 using the second decoy credentials.
There is additionally provided in accordance with an embodiment of the present invention a network surveillance method to detect attackers, including planting one or more honeytokens in one or more resources in a network of computers in which users access the resources in the network based on credentials, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to access a second resource using decoy credentials, including planting a first honeytoken in a first resource, R1, used to access a second resource, R2, using first decoy credentials, and planting a second honeytoken in R2, used to access a third resource, R3, using second decoy credentials, and alerting that an attacker is intruding the network only in response to both (i) an attempt to access R2 using the first decoy credentials, and (ii) a subsequent attempt to access R3 using the second decoy credentials.
There is further provided in accordance with an embodiment of the present invention a system for two-factor network surveillance to detect attackers, including a management server within a network of resources in which users access the resources in the network based on credentials, including a deployment module planting one or more honeytokens in one or more of the resources in the network, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to access a second resource using decoy credentials, and wherein the deployment module plants a first honeytoken in a first resource, R1, used to access a second resource, R2, using first decoy credentials, and plants a second honeytoken in R1, used to access a third resource, R3, using second decoy credentials, and an alert module alerting that an attacker is intruding the network only in response to both (1) an attempt to access R2 using the first decoy credentials, and (2) a subsequent attempt to access R3 using the second decoy credentials.
There is yet further provided in accordance with an embodiment of the present invention a network surveillance method to detect attackers, including planting one or more honeytokens in one or more resources in a network of computers in which users access the resources in the network based on credentials, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to access a second resource using decoy credentials, including planting a first honeytoken in a first resource, R1, used to access a second resource, R2, using first decoy credentials and planting a second honeytoken in R1, used to access a third resource, R3, using second decoy credentials, and alerting that an attacker is intruding the network only in response to both (i) an attempt to access R2 using the first decoy credentials, and (ii) a subsequent attempt to access R3 using the second decoy credentials.
There is moreover provided in accordance with an embodiment of the present invention a system for two-factor network surveillance to detect attackers, including a management server within a network of resources, some of the resources being legitimate enterprise resources and others of the resources being decoy resources for the purpose of intrusion detection, the management server including a deployment module planting one or more honeytokens in one or more of the resources in the network, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to discover existence of a second resource, and wherein said deployment module plants a first honeytoken in a resource, R, used to discover a first decoy resource, R1, and plants a second honeytoken in R1, used to discover a second decoy resource, R2, and an alert module alerting that an attacker is intruding the network only in response to both (1) an attempt to access R1, and (2) an attempt to access R2.
There is additionally provided in accordance with an embodiment of the present invention a network surveillance method to detect attackers, including planting one or more honeytokens in one or more resources of a network of resources, some of the resources being legitimate enterprise resources and others of the resources being decoy resources for the purpose of intrusion detection, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to discover existence of a second resource, including planting a first honeytoken in a resource, R, used to discover a first decoy resource, R1, and planting a second honeytoken in R1, used to discover a second decoy resource, R2, and alerting that an attacker is intruding the network only in response to both (i) an attempt to access R1, and (ii) an attempt to access R2.
There is further provided in accordance with an embodiment of the present invention a system for two-factor network surveillance to detect attackers, including a management server within a network of resources, some of the resources being legitimate enterprise resources and others of the resources being decoy resources for the purpose of intrusion detection, the management server including a deployment module planting one or more honeytokens in one or more of the resources in the network, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to discover existence of a second resource, and wherein the deployment module plants a first honeytoken in a resource, R, used to discover a first decoy resource, R1, and plants a second honeytoken in R, used to discover a second decoy resource, R2, and an alert module alerting that an attacker is intruding the network only in response to both (1) an attempt to access R1, and (2) an attempt to access R2.
There is yet further provided in accordance with an embodiment of the present invention a network surveillance method to detect attackers, including planting one or more honeytokens in one or more resources of a network of resources, some of the resources being legitimate enterprise resources and others of the resources being decoy resources for the purpose of intrusion detection, wherein a honeytoken is an object in memory or storage of a first resource that may be used by an attacker to discover existence of a second resource, including planting a first honeytoken in a resource, R, used to discover a first decoy resource, R1, and planting a second honeytoken in R, used to discover a second decoy resource, R2, and alerting that an attacker is intruding the network only in response to both (i) an attempt to access R1, and (ii) an attempt to access R2.
The present invention will be more fully understood and appreciated from the following detailed description, taken in conjunction with the drawings in which:
For reference to the figures, the following index of elements and their numerals is provided. Similarly numbered elements represent elements of the same type, but they need not be identical elements.
Elements numbered in the 1000's are operations of flow charts.
In accordance with embodiments of the present invention, systems and methods are provided for dynamically managing decoy policies for an enterprise network, which are planted in such a way as to increase confidence of detecting an attacker of the network, and to reduce false alerts.
Reference is made to
A honeytoken may be embodied as an object in memory or storage of a first resource within network 200 that may be used by an attacker to access a second resource within network 200, or merely to discover the existence of a second resource without being able to access it. In some cases, the first and second resources reside on the same computer, e.g., the second resource may be a service or application that requires a higher level of authentication than the first resource. A honeytoken may also be embodied as data, such as packet data, transmitted to or from a resource within network 200 or between resources within network 200. An attacker generally uses honeytokens as clues within a treasure hunt.
The resource that a honeytoken points to may be (i) a real resource that exists within network 200, e.g., an FTP server, (ii) a decoy resource that exists within network 200, e.g., a decoy server 240, or (iii) a resource that does not exist. In the latter case, when an attacker attempts to access a resource that does not exist, access governor 150 recognizes a pointer to a resource that is non-existent. Access governor 150 responds by notifying management server 210, or by re-directing the pointer to a resource that does exist in order to survey the attacker's moves, or both.
Database 220 stores honeytokens that fake detection of and access to computers 110, servers 120 and other resources in network 200. Honeytokens include inter alia:
The honeytokens stored in database 220 are categorized by families, such as inter alia
Database 220 communicates with an update server 260, which updates database 220 as new types of honeytokens for detecting and accessing computers evolve over time, and as new algorithms for generating honeytokens arise. In addition to the honeytokens residing within database 200, new honeytokens are also created dynamically.
Policy database 230 stores policies for planting honeytokens in computers of network 200. Each policy specifies honeytokens that are planted in the computers, in accordance with honeytokens stored in database 220 and in accordance with new honeytokens that are dynamically generated. Honeytoken user credentials planted on a computer may lead to another resource in the network. Honeytokens to access an FTP, or other server, planted on a computer may lead to a decoy server 240.
It will be appreciated by those skilled in the art the databases 220 and 230 may be combined into a single database, or distributed over multiple databases.
Management server 210 includes a policy manager 211, a deployment module 212, and a forensic application 213. Policy manager 211 defines a decoy and response policy. The decoy and response policy defines different honeytoken types, different honeytoken combinations, response procedures, notification services, and assignments of policies to specific network nodes, network users, groups of nodes or users or both. Once policies are defined, they are stored in policy database 230 with the defined assignments.
In some embodiments of the present invention, some or all components of management server 210 may be integrated within an already existing enterprise deployment agent.
Deception management server 210 obtains the policies and their assignments from policy database 230, and delivers them to appropriate nodes and groups. It then launches deployment module 212 to plant honeytoken on end points, servers, applications, routers, switches, relays and other entities in the network. Deployment module 212 plants each honeytoken, based on its type, in memory (RAM), disk, or in any other data or information storage area, as appropriate, or as data, such as packet data, that is transmitted to or from a resource within network 200 or between resources of network 200. Deployment module 212 plants the honeytokens in such a way that the chances of a valid user accessing the honeytokens are low. Deployment module 212 may or may not stay resident.
Forensic application 213 is a real-time application that is transmitted to a destination computer in the network, when a honeytoken is accessed by a computer 110. When forensic application 213 is launched on the destination computer, it identifies a process running within that computer 110 that accessed that honeytoken, logs the activities performed by the thus-identified process in a forensic report, and transmits the forensic report to decoy management server 210. Forensic application 213 also identifies and logs recent file activity, connection activity, background activity, and other time-based information that may be used to track an attacker's activity.
Once an attacker is detected, a “response procedure” is launched. The response procedure includes inter alia various notifications to various addresses, and actions on a decoy server such as launching an investigation process, and isolating, shutting down and re-imaging one or more network nodes. The response procedure collects information available on one or more nodes that may help in identifying the attacker's attack acts, intention and progress.
Each decoy server 240 includes a forensic alert module 242, which creates a log and/or alerts management system 210 that an attacker is accessing the decoy server via a computer 110 of the network, and causes management server 210 to send forensic application 213 to the computer that is accessing the decoy server. In an alternative embodiment of the present invention, decoy server 240 may store forensic application 213, in which case decoy server 240 may transmit forensic application 213 directly to the computer that is accessing the decoy server. In another alternative embodiment of the present invention, management server 210 or decoy server 240 may transmit forensic application 213 to a destination computer other than the computer that is accessing the decoy server. Access governor 150 also activates a forensic alert module 252, which creates a log and/or alerts management server 210 that an attacker is attempting to use a decoy credential.
Notification servers (not shown) are notified when an attacker uses a honeytoken. The notification servers may discover this by themselves, or by using information stored on access governor 150 and SIEM 160. The notification servers forward notifications, or results of processing multiple notifications, to create notification time lines or such other analytics.
As mentioned above, conventional honeypot systems generate many fake alerts. Embodiments of the present invention enhance confidence levels in identifying an attacker, by luring him into multiple access attempts to different resources monitored by the system, or into a single access attempt that requires multiple actions. The access attempts are comprised of multiple factors, each factor having a likelihood of being the intentional action of an attacker.
Reference is made to
At operation 1130 the attacker derives the cleartext password from <hash>. Operation 1130 may be performed by rainbow tables, which are pre-computed tables used by attackers for reversing cryptographic hash functions. At operation 1140 the attacker attempts a login to computer B using the cleartext version of the decoy credentials <username> <cleartext password>. At this stage, the chances of such login being performed by a valid user or automated monitor are extremely low, since this login requires two suspicious factors; namely, (i) extracting the decoy credentials with the hash value of the cleartext password from computer A, and (ii) reversing the extracted hash value to obtain the cleartext password.
It is noted in
Reference is made to
Reference is made to
The successive honeytokens are arranged such that each honeytoken may only be obtained after obtaining the previous ones, similar to successive clues in a treasure hunt, where one clue leads to the next. In the subject environment of intrusion detection, the clues are decoys. Thus, referring to
Resources A, B, C and D in
As explained with reference to
Reference is made to
As explained with reference to
When an attacker discovers a honeytoken with a name and credentials of a resource, the attacker may nevertheless attempt accessing the resource with different credentials or via an exploit.
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made to the specific exemplary embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Number | Name | Date | Kind |
---|---|---|---|
6363489 | Comay et al. | Mar 2002 | B1 |
6618709 | Sneeringer | Sep 2003 | B1 |
7065657 | Moran | Jun 2006 | B1 |
7089589 | Chefalas et al. | Aug 2006 | B2 |
7093291 | Bailey | Aug 2006 | B2 |
7516227 | Cohen | Apr 2009 | B2 |
7574741 | Aviani et al. | Aug 2009 | B2 |
7636944 | Raikar | Dec 2009 | B2 |
7665134 | Hernacki et al. | Feb 2010 | B1 |
7694339 | Blake et al. | Apr 2010 | B2 |
7725937 | Levy | May 2010 | B1 |
7752664 | Satish et al. | Jul 2010 | B1 |
7945953 | Salinas et al. | May 2011 | B1 |
8015284 | Isenberg et al. | Sep 2011 | B1 |
8181249 | Chow et al. | May 2012 | B2 |
8181250 | Rafalovich et al. | May 2012 | B2 |
8250654 | Kennedy et al. | Aug 2012 | B1 |
8375447 | Amoroso et al. | Feb 2013 | B2 |
8499348 | Rubin | Jul 2013 | B1 |
8528091 | Bowen et al. | Sep 2013 | B2 |
8549642 | Lee | Oct 2013 | B2 |
8549643 | Shou | Oct 2013 | B1 |
8719938 | Chasko et al. | May 2014 | B2 |
8739281 | Wang et al. | May 2014 | B2 |
8739284 | Gardner | May 2014 | B1 |
8769684 | Stolfo et al. | Jul 2014 | B2 |
8819825 | Keromytis et al. | Aug 2014 | B2 |
8826400 | Amaya Calvo | Sep 2014 | B2 |
8856928 | Rivner et al. | Oct 2014 | B1 |
8880435 | Catlett | Nov 2014 | B1 |
8881288 | Levy et al. | Nov 2014 | B1 |
8925080 | Hebert | Dec 2014 | B2 |
9009829 | Stolfo et al. | Apr 2015 | B2 |
9043905 | Allen et al. | May 2015 | B1 |
9124622 | Falkowitz et al. | Sep 2015 | B1 |
9152808 | Ramalingam et al. | Oct 2015 | B1 |
9240976 | Murchison | Jan 2016 | B1 |
9325728 | Kennedy et al. | Apr 2016 | B1 |
9350748 | McClintock | May 2016 | B1 |
9356942 | Joffe | May 2016 | B1 |
9379896 | Altman | Jun 2016 | B1 |
9386030 | Vashist et al. | Jul 2016 | B2 |
9418222 | Rivera | Aug 2016 | B1 |
9495188 | Ettema et al. | Nov 2016 | B1 |
20020066034 | Schlossberg et al. | May 2002 | A1 |
20020194489 | Almogy et al. | Dec 2002 | A1 |
20030084349 | Friedrichs et al. | May 2003 | A1 |
20030110396 | Lewis et al. | Jun 2003 | A1 |
20030145224 | Bailey | Jul 2003 | A1 |
20040088581 | Brawn et al. | May 2004 | A1 |
20040128543 | Blake et al. | Jul 2004 | A1 |
20040148521 | Cohen et al. | Jul 2004 | A1 |
20040160903 | Gai et al. | Aug 2004 | A1 |
20040172557 | Nakae et al. | Sep 2004 | A1 |
20040255155 | Stading | Dec 2004 | A1 |
20050114711 | Hesselink et al. | May 2005 | A1 |
20050132206 | Palliyil et al. | Jun 2005 | A1 |
20050149480 | Deshpande | Jul 2005 | A1 |
20050235360 | Pearson | Oct 2005 | A1 |
20060010493 | Piesco et al. | Jan 2006 | A1 |
20060041761 | Neumann et al. | Feb 2006 | A1 |
20060069697 | Shraim et al. | Mar 2006 | A1 |
20060101516 | Sudaharan et al. | May 2006 | A1 |
20060161982 | Chari et al. | Jul 2006 | A1 |
20060224677 | Ishikawa et al. | Oct 2006 | A1 |
20060242701 | Black et al. | Oct 2006 | A1 |
20070028301 | Shull et al. | Feb 2007 | A1 |
20070039038 | Goodman et al. | Feb 2007 | A1 |
20070157315 | Moran | Jul 2007 | A1 |
20070192853 | Shraim et al. | Aug 2007 | A1 |
20070226796 | Gilbert et al. | Sep 2007 | A1 |
20070299777 | Shraim et al. | Dec 2007 | A1 |
20080016570 | Capalik | Jan 2008 | A1 |
20080086773 | Tuvell et al. | Apr 2008 | A1 |
20080155693 | Mikan et al. | Jun 2008 | A1 |
20090019547 | Palliyil et al. | Jan 2009 | A1 |
20090144827 | Peinado et al. | Jun 2009 | A1 |
20090222920 | Chow et al. | Sep 2009 | A1 |
20090241173 | Troyansky | Sep 2009 | A1 |
20090241191 | Keromytis et al. | Sep 2009 | A1 |
20090241196 | Troyansky et al. | Sep 2009 | A1 |
20090328216 | Rafalovich et al. | Dec 2009 | A1 |
20100058456 | Jajodia et al. | Mar 2010 | A1 |
20100071051 | Choyi et al. | Mar 2010 | A1 |
20100077483 | Stolfo | Mar 2010 | A1 |
20100082513 | Liu | Apr 2010 | A1 |
20100251369 | Grant | Sep 2010 | A1 |
20100269175 | Stolfo et al. | Oct 2010 | A1 |
20110016527 | Yanovsky et al. | Jan 2011 | A1 |
20110154494 | Sundaram et al. | Jun 2011 | A1 |
20110167494 | Bowen et al. | Jul 2011 | A1 |
20110214182 | Adams et al. | Sep 2011 | A1 |
20110258705 | Vestergaard et al. | Oct 2011 | A1 |
20110307705 | Fielder | Dec 2011 | A1 |
20120005756 | Hoefelmeyer et al. | Jan 2012 | A1 |
20120084866 | Stolfo | Apr 2012 | A1 |
20120167208 | Buford et al. | Jun 2012 | A1 |
20120210388 | Kolishchak | Aug 2012 | A1 |
20120246724 | Sheymov et al. | Sep 2012 | A1 |
20120311703 | Yanovsky et al. | Dec 2012 | A1 |
20130061055 | Schibuk | Mar 2013 | A1 |
20130086691 | Fielder | Apr 2013 | A1 |
20130212644 | Hughes et al. | Aug 2013 | A1 |
20130227697 | Zandani | Aug 2013 | A1 |
20130263226 | Sudia | Oct 2013 | A1 |
20140082730 | Vashist et al. | Mar 2014 | A1 |
20140101724 | Wick et al. | Apr 2014 | A1 |
20140115706 | Silva et al. | Apr 2014 | A1 |
20140201836 | Amsler | Jul 2014 | A1 |
20140208401 | Balakrishnan et al. | Jul 2014 | A1 |
20140237599 | Gertner et al. | Aug 2014 | A1 |
20140259095 | Bryant | Sep 2014 | A1 |
20140298469 | Marion | Oct 2014 | A1 |
20140310770 | Mahaffey | Oct 2014 | A1 |
20140337978 | Keromytis et al. | Nov 2014 | A1 |
20140359708 | Schwartz | Dec 2014 | A1 |
20150007326 | Mooring et al. | Jan 2015 | A1 |
20150013006 | Shulman | Jan 2015 | A1 |
20150047032 | Hannis et al. | Feb 2015 | A1 |
20150074750 | Pearcy et al. | Mar 2015 | A1 |
20150074811 | Capalik | Mar 2015 | A1 |
20150096048 | Zhang et al. | Apr 2015 | A1 |
20150128246 | Feghali et al. | May 2015 | A1 |
20150156211 | Chi Tin et al. | Jun 2015 | A1 |
20150326587 | Vissamsetty et al. | Nov 2015 | A1 |
20150326598 | Vasseur et al. | Nov 2015 | A1 |
20160019395 | Ramalingam et al. | Jan 2016 | A1 |
20160080414 | Kolton et al. | Mar 2016 | A1 |
20160212167 | Dotan et al. | Jul 2016 | A1 |
20160261608 | Hu et al. | Sep 2016 | A1 |
20160300227 | Subhedar et al. | Oct 2016 | A1 |
20160308895 | Kotler et al. | Oct 2016 | A1 |
20160323316 | Kolton et al. | Nov 2016 | A1 |
20160373447 | Akiyama | Dec 2016 | A1 |
20170032130 | Joseph Durairaj et al. | Feb 2017 | A1 |
Number | Date | Country |
---|---|---|
2006131124 | Dec 2006 | WO |
2015001969 | Jan 2015 | WO |
2015047555 | Apr 2015 | WO |
Entry |
---|
Wikipedia, Active Directory, https://en.wikipedia.org/wiki/Active_Directory, Jun. 24, 2015. |
Wikpedia, Apple Filing Protocol, https://en.wikipedia.org/wiki/Apple_Filing_Protocol, Aug. 14, 2015. |
Wikipedia, DMZ (computing), https://en.wikipedia.org/wiki/DMZ_(computing), Jun. 17, 2015. |
Wikipedia, Domain Name System, https://en.wikipedia.org/wiki/Domain_Name_System, Jul. 14, 2015. |
Wikipedia, Firewall (computing), https://en.wikipedia.org/wiki/Firewall_(computing), Jul. 14, 2015. |
Wikipedia, Honeypot (computing), https://en.wikipedia.org/wiki/Honeypot_(computing), Jun. 21, 2015. |
Wikipedia, Kerberos (protocol), https://en.wikipedia.org/wiki/Kerberos_(protocol), Jun. 30, 2015. |
Wikipedia, Lightweight Directory Access Protocol, https://en.wikipedia.org/wiki/Lightweight_Directory_Access_Protocol, Aug. 15, 2015. |
Wikipedia, LM hash, https://en.wikipedia.org/wiki/LM_hash, Jun. 8, 2015. |
Wikipedia, RADIUS, https://en.wikipedia.org/wiki/RADIUS, Aug. 16, 2015. |
Wikipedia, Rainbow table, https://en.wikipedia.org/wiki/Rainbow_table, Jul. 14, 2015. |
Wikipedia, Secure Shell, https://en.wikipedia.org/wiki/Honeypot_(computing), Jul. 12, 2015. |
Wikipedia, Security Information and Event Management, https://en.wikipedia.org/wiki/Security_information_and_event_management, Jun. 23, 2015. |
Wikipedia, Tarpit (networking), https://en.wikipedia.org/wiki/Tarpi_(networking), Jul. 3, 2014. |
Mishra et al., Intrusion detection in wireless ad hoc networks, IEEE Wireless Communications, Feb. 2004, pp. 48-60. |
Zhang et al., Intrusion detection techniques for mobile wireless networks, Journal Wireless Networks vol. 9(5), Sep. 2003, pp. 545-556, Kluwer Academic Publishers, the Netherlands. |
U.S. Appl. No. 15/004,904, Office Action, dated May 27, 2016, 16 pages. |
U.S. Appl. No. 15/004,904, Notice of Allowance, dated Oct. 19, 2016, 13 pages. |
U.S. Appl. No. 15/175,048, Notice of Allowance, dated Oct. 13, 2016, 17 pages. |
U.S. Appl. No. 15/175,050, Office Action, dated Aug. 19, 2016, 34 pages. |
U.S. Appl. No. 15/175,050, Office Action, dated Nov. 30, 2016, 31 pages. |
U.S. Appl. No. 15/175,050, Notice of Allowance, dated Mar. 21, 2017, 13 pages. |
U.S. Appl. No. 15/175,052, Office Action, dated Feb. 13, 2017, 19 pages. |
U.S. Appl. No. 15/175,052, Office Action, dated Jun. 6, 2017, 19 pages. |
U.S. Appl. No. 15/175,052, Notice of Allowance, dated Jan. 2, 2018, 9 pages. |
U.S. Appl. No. 15/175,054, Notice of Allowance, dated Feb. 21, 2017, 13 pages. |
U.S. Appl. No. 15/403,194, Office Action, dated Feb. 28, 2017, 13 pages. |
U.S. Appl. No. 15/403,194, Notice of Allowance, dated Jun. 16, 2017, 9 pages. |
U.S. Appl. No. 15/406,731, Notice of Allowance, dated Apr. 20, 2017, 15 pages. |
U.S. Appl. No. 15/679,189, Notice of Allowance, dated Mar. 26, 2018, 14 pages. |
U.S. Appl. No. 15/722,351, Notice of Allowance, dated Mar. 9, 2018, 17 pages. |
PCT Application No. PCT/IL16/50103, International Search Report and Written Opinion, dated May 26, 2016, 9 pages. |
PCT Application No. PCT/IL16/50579, International Search Report and Written Opinion, dated Sep. 30, 2016, 7 pages. |
PCT Application No. PCT/IL16/50581, International Search Report and Written Opinion, dated Nov. 29, 2016, 10 pages. |
PCT Application No. PCT/IL16/50582, International Search Report and Written Opinion, dated Nov. 16, 2016, 11 pages. |
PCT Application No. PCT/IL16/50583, International Search Report and Written Opinion, dated Dec. 8, 2016, 10 pages. |
Number | Date | Country | |
---|---|---|---|
20180234438 A1 | Aug 2018 | US |
Number | Date | Country | |
---|---|---|---|
62172251 | Jun 2015 | US | |
62172253 | Jun 2015 | US | |
62172255 | Jun 2015 | US | |
62172259 | Jun 2015 | US | |
62172261 | Jun 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15175052 | Jun 2016 | US |
Child | 15942593 | US |