The present application is a National Phase entry of PCT Application No. PCT/EP2017/068738, filed Jul. 25, 2017, which claims priority from EP Patent Application No. 16184383.4 filed Aug. 16, 2016 each of which is hereby fully incorporated herein by reference.
The present disclosure relates to the detection of computer security threats.
Computer systems such as virtual machines (VMs) executing in virtualized computing environments (VCEs) such as cloud computing environments may look like any physical, networked or standalone computer system such as a personal computing device and are therefore equally susceptible to any kind of cyber-attack if not properly protected. For example, a VM may become infected by malware communicated via network communication or when a user opens an infected email attachment or connects to malicious websites. Once a VM is infected it may become part of a group of collectively controlled systems such as a “botnet” for use by an adversary or hacker to coordinate further cyber-attacks on other systems communicatively connected to compromised systems, such as via the Internet.
Thus there is a need to protect such virtualized computer systems from such attacks.
The present disclosure accordingly provides, in a first aspect, a computer implemented method to mitigate a security attack against a target virtual machine (VM) in a virtualized computing environment, the target VM having a target VM configuration including configuration parameters, and the security attack exhibiting a particular attack characteristic, the method comprising: training a machine learning algorithm as a classifier based on a plurality of training data items, each training data item corresponding to a training VM and including a representation of parameters for a configuration of the training VM and a representation of characteristics of security attacks for the training VM; generating a first data structure for storing one or more relationships between VM configuration parameters and attack characteristics, wherein the first data structure is generated by sampling the trained machine learning algorithm to identify the relationships; receiving a second data structure storing a directed graph representation of one or more sequences of VM configuration parameters for achieving the particular attack characteristic of the security attack, the VM parameters in the directed graph being determined based on the first data structure; identifying VM parameters of the target VM used in the security attack as a subset of sequences in the directed graph corresponding to VM parameters of the target VM; and reconfiguring the target VM by changing at least one of the identified VM parameters so as to stop the attack.
In some embodiments each of the attack characteristics has associated a protective measure, the method further comprising, in response to the identification of an attack characteristic to which the target VM is susceptible, implementing the protective measure so as to protect the VM from attacks having the attack characteristic.
In some embodiments the machine learning algorithm is a restricted Boltzmann machine.
In some embodiments the characteristics of security attacks include an indication of the consequence of a security attack executing in the training VM.
In some embodiments each training data item comprises a vector of binary values indicating each indicating a presence or absence of a configuration feature and an attack characteristic of a corresponding training VM.
In some embodiments the data structure is a matrix data structure for mapping VM configuration parameters against attack characteristics.
In some embodiments the restricted Boltzmann machine includes a plurality of hidden units and a plurality of visible units, and sampling the trained machine learning algorithm includes generating sample inputs for the hidden units to determine values of the visible units.
In some embodiments each generated sample input is a vector of binary values wherein each binary value is determined using a randomization algorithm.
In some embodiments each protective measure is a configuration parameter or a change to a configuration parameter for a VM to protect against an attack characteristic.
The present disclosure accordingly provides, in a second aspect, a computer system including a processor and memory storing computer program code for performing the method set out above.
The present disclosure accordingly provides, in a third aspect, a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the method set out above.
Embodiments of the present disclosure will now be described, by way of example only, with reference to the accompanying drawings, in which:
One example of an attack employing compromised VMs is coordinated by a “botnet controller”—known as “Command and Control” (C&C)—which may control a number of infected machines (any of which may be physical, virtual, cloud-hosted or standalone machines) to launch different kinds of attack.
In order to protect a VM from becoming compromised by a malicious attack and potentially infected and/or recruited into a botnet a user (or system administrator) needs to apply appropriate security measures such as, inter alia, installing up-to-date anti-malware software, configuring firewalls to block suspicious network communication, and/or apply latest security patches for an operating system etc. Additionally, a user must be vigilant when opening emails from unknown sources or accessing data, files or software communicated via a network such as the internet. While such measures can provide protection in general, it may not be sufficient to protect against more sophisticated attacks or zero-day attacks that are relatively unknown. There is also a lack of security knowledge among many users which can lead to non-optimal configuration of security software (e.g. firewall) or unsafe access to materials via a network (e.g. unsafe browsing, not being aware of unsecure network connections such as non-HTTPS connections, etc.). In particular, for cloud-hosted machines cloud providers frequently employ VM or system templates to assist users in deploying new VMs. Leaving a VM configuration at least partly in a default, template or original state can pose a security risk since a potential adversary may have knowledge of such a default configuration and may be able to exploit any vulnerability in a deployed VM to compromise it.
Embodiments of the present disclosure seek to addresses the security issues of virtualized computing environments such as cloud computing environments by obtaining configuration and/or security related features from VMs, combining them with detected attack characteristics and/or an absence of attack information and applying a machine learning approach to determine whether or not a particular VM may be susceptible to attack.
Infected VMs 106 are controlled by a botnet controller 100 such as to launch an attack campaign. Infected VMs 106 can be part of multiple or different botnets, i.e. controlled by different botnet controllers. VCEs may physically be located in different geographical areas, may be managed by a single or more service providers. In each VCE a service provider manages configuration information 110 and security information 112. Configuration information 110 is information relating to a configuration of one or more VMs executing in the VCE 102. The configuration information may be specific to a VM or apply to multiple VMs and includes an identification and/or definition or resources and/or configurations deployed for a VM. For example, via the configuration information 110 configuration parameters of each VM can be identified including, inter alia: Operating system identification; Network topology; VPN configuration; DNS settings; Email configuration; a Security configuration, e.g. Antivirus, Firewall, etc. Thus the configuration information 110 is suitable for defining one or more VM characteristics 114 for VMs in the VCE.
The security information 112 is information relating to one or more security facilities of the VCE 102 and/or individual VMs deployed therein. In particular, the security information includes information sufficient to determine characteristics of any attack(s) that have occurred in a VM in the VCE such as, inter alia: an indication of the execution of malware; an indication of unauthorized changes to system files; a connection to a known illicit, malicious or unsecure network such as “darknet”; and other such attack characteristics as will be apparent to those skilled in the art and that can be identified and recorded by security services such as security software. For example, the security information 112 can include information including, inter alia, information from VCE-wide security sensors, i.e. IDS (Intrusion Detection System), Firewall, Web-Proxy, etc. The security information 112 provides characteristics 116 or features of successful attacks on any VM within the VCE, such as: Attack type, e.g. Virus, Trojan, etc.; Attack method, e.g. SQL injection, XSS, etc.; IP domain; Used ports, protocols or user agents, etc. Thus the security information 112 is suitable for defining one or more attack characteristics 116 for VMs in the VCE. In some embodiments the security information 112 is specific to each of one or more VMs 104, 106 and can be obtained, stored, handled and/or managed by such VMs individually.
As illustrated in
The latent factor extractor 130 is a component for identifying latent factors in a set of binary vectors such as a machine learning algorithm. For example, the latent factor extractor 130 can employ a restricted Boltzmann machine as described below. Latent factors (or latent variables) are features that are not directly observed in the binary vectors but that can be inferred such as through a mathematical model from the binary vectors. In particular, latent factors can be used to identify associations between the elements in binary vectors by, for example, categorizing binary vectors.
The data structure manager 140 is a component for generating a data structure as a feature classification 142 that classifies latent factors to identify and recognize associations between aspects of the latent factors as will be explained in detail below.
The attack analysis and assessment component 118 receives or accesses configuration characteristics 114 and attack characteristics 116 for each of a plurality of VMs to generate each of a configuration feature set {X} 124 and an attack feature set {A} 126 respectively. Configuration feature set {X} consists of elements each corresponding to a configuration feature of a VM. Similarly, attack feature set {A} consists of elements each corresponding to a feature of a successful attack against the VM. For each VM the configuration features {X} and attack features {A} are combined together as input to the latent factor extractor 130. The combine sets {{X}, {A}} for each of multiple VMs are used as training data for the latent factor extractor 130. Following all training based on input sets {X} and {A} for multiple VMs the latent factor extractor 130 generates, as an output, a reduced set of features {Y} representing learned underlying latent factors. Notably, the features set {Y} is not necessarily a subset of features in all of the feature sets {X}.
The feature sets {X}, {A} and {Y} are subsequently used by the data structure generator 140 to generate a data structure classifying configuration features, i.e. subsets of {X}, that are indicated as permitting particular classes of attack (i.e. types of attack or attack scenarios). The mappings between the relevant configuration parameters and attack characteristics can be represented in an association data structure such as the matrix 142 depicted in
Thus from the data structure 142 it is possible to determine a configuration of a VM that may be susceptible to particular classes of attack. Equally, it is possible to determine configurations of VM that are indicated to be less susceptible to particular classes of attack. Accordingly, on the basis of the reduced set of features determined by learning of the latent factor extractor 130 an indication of susceptibility of a VM configuration can be evaluated, and further a configuration or modifications to a configuration of a VM can be determined. Thus in some embodiments a component implemented as hardware, software, firmware or a combination component such as monitoring agents instantiated with, within or in association with one or more VMs and in communication with an attack analysis and assessment component 118 according to
In embodiments of the present disclosure the latent feature extractor 130 includes an RBM as a classifier where the RBM is trained to model a joint probability distribution of inputs (features set {X} of VM configuration features based on VM characteristics 114) and corresponding labels (features set {A} of attack features based on attack characteristics 116), both represented by the visible units of the RBM. The hidden units represent a reduced set of features {Y} that, after training, can constitute a set of latent factors. The RBM works by updating states of some units given the states of others. A unit can have a binary state: state 0 (false—not activated); or state 1 (true—activated). Hence the VM configuration features and attack features can be represented as a binary vector.
For example, a set of features {X} for VM configuration features can include binary indications of the following features:
For example, a set of detected attack features {A} for a VM can include binary indications of the following features:
Prior to training the RBM a set of management features {X} and attack feature {A} for an entire training data set need to be determined. It is necessary to determine the aggregate set of VM configuration features and attack features for the plurality of VMs in the training data set in order to determine a size of a required binary vector and, accordingly, a number of visible units for the RBM. For example, training data can consist of configuration features for a plurality of VMs with confirmed attack features. This means that there will be different sets of VM configuration parameters and attack characteristics for different VMs. Some of the configuration parameters are shared among the VMs and some are not. The same also applies to the attack features. Therefore, when a complete set of features {X} is passed to an RBM's visible units for a single VM, some visible units will activate (indicating features that are present in the set {X}, such as by binary ‘1’ indication) and some will not (features that are absent in the set {X}, such as by binary ‘0’ indication).
Additionally, in some embodiments the configuration features of VMs which are confirmed to not have suffered any attack or infection can optionally be provided as further training data by mapping into an input binary vector for visible units with the corresponding attack feature vector being set to all zeros or false (to indicate no attack). Such an approach provides non-attacked VM configurations to the RBM to support the RBM in learning how to classify potentially safely-configured VMs.
Thus the RBM is trained with example features from infected and non-infected VMs input as inputs to the visible units. The objective of the training process is for the RBM to learn connection weights between the units, i.e. visible, hidden and bias. The training can be performed using an algorithm known as “Contrastive Divergence Learning” such as is described in Geoffrey Hinton's paper “A Practical Guide to Training Restricted Boltzmann Machines” (Aug. 2, 2010; University of Toronto Department of Computer Science). In summary contrastive divergence involves performing a number of iterations to compute states of hidden units based on states of visible units and vice versa, where the states of visible units are reconstructed from the hidden units. A number of iterations increases with learning steps to achieve improved accuracy. A number of hidden units is estimated at the start of learning phase and may be adapted to achieve better accuracy.
The trained RBM constitutes a model for the joint probability distribution of all inputs consisting of features sets {X} and {A}. The model is mainly represented by the computed weights of the connections between visible (v) and hidden (h) units/neurons. The distribution function p(v,h) is determined by the activation energy function E(v,h) defined by the model. p(v,h) is close to 1 for large positive activation energies, and p(v,h) close to 0 for negative activation energies. Units that are positively connected to each other try to get each other to share the same state (i.e., be both on or off), while units that are negatively connected to each other are enemies that prefer to be in different states. This behavior can also be used to determine a susceptibility to attack in embodiments of the present disclosure.
Following training of the RBM the data structure manager 140 subsequently generates the feature classification data structure 142 such as a matrix, table or the like such as the matrix illustrated in
The resulting data structure (matrix) can subsequently be employed for: reconstructing possible attack scenarios for compromising a VM; determining a susceptibility of a VM configuration to an attack scenario; and determining a VM configuration for mitigating or reducing a susceptibility to an attack scenario.
For example, each attack characteristic can have associated one or more protective measures such, inter alia: a configuration parameter or change to a configuration parameter for a VM to protect against attacks exhibiting a particular characteristic, such as disabling DNS redirection, restricting access to certain resources such as files or directories, closing certain network ports, and the like; and/or an additional function, routine, facility, service or other resource suitable for detecting and/or protecting against attacks exhibiting a particular characteristic, such as antimalware software, intrusion detection facilities, proxies and firewalls and the like.
Thus, in this way embodiments of the present disclosure provide for the determination of susceptibility of a target VM to security attacks. The susceptibility can be quantified such as a degree of susceptibility and remediation or protective measures or deployment determinations for the target VM can be based on the determined degree of susceptibility.
It will be appreciated by those skilled in the art that protection against attacks exhibiting a particular attack characteristic need not provide a guarantee of absolute avoidance or removal of attacks with such characteristics, rather protection seeks to reduce susceptibility, mitigate and/or avoid such attacks.
Thus the VM associated with the VM configuration of
Once such VM configuration parameters have been identified then mitigation measures against the security attack can be employed.
As an alternative to mitigating an attack by the inclusion of security features, modifications to VM configuration parameters themselves may be adopted.
One challenge remaining with the approach of
To illustrate this challenge clearly reference is made to
In some cases mitigation of a particular VM parameter may not be possible or may be undesirable. For example, a security facility may not be available for a particular VM parameter and/or it may not be possible to reconfigure a VM parameter due to constraints on the VM. For example, a VM operating as a web server must communicate via HTTP networking ports and it may therefore not be possible to close those ports on such a server. Accordingly, it can be desirable to select mitigation measures and vertices in the graph as a basis for mitigation based on some ranking, prioritization or preference mechanism such that more appropriate/preferred VM parameters are modified in favor of less appropriate/preferred parameters.
In one embodiment some or all vertices (and the VM parameters they represent) in the directed graph are each associated with a predetermined weight or score. In such an embodiment the predetermined criteria for selecting vertices for mitigation are defined based on such weights or scores. For example, individual vertices can be selected that meet a predetermined threshold weight or score. Alternatively, a collection of vertices can be selected that collectively meet a predetermined weight or score (i.e. a total of all weights or scores meets a predetermined condition). Such a condition can be, for example, a maximum or minimum weight or score. Such an approach is helpful where it is desirable to indicate an importance, relevance, appropriateness or preference of VM parameters such that, for example, a weight or score can indicate an importance of a VM parameter where parameters that are more important have more impact on an overall weight.
Thus
All the above methods are effective for identifying and/or mitigating attacks exhibiting an attack characteristic. However, a challenge remains where an attack characteristic continues to be observed in a VM despite mitigation. For example, where all sequences through the directed graph are blocked and yet an attack persists. Such attack characteristics can arise as a result of the attack adapting to employ other services and/or facilities of a VM not currently modeled in the directed graph. Such a situation can be addressed by causing the retraining of the RBM to provide for the regeneration of the feature classification data structure. In particular, the retraining of the RBM must be undertaken with at least some training examples (data items) corresponding to the attack having the attack characteristic that exists despite the mitigation measures. Accordingly, the retraining will generate a new feature classification data structure 142 on which bases a new directed graph can be generated. Such new directed graph can then be employed to model the VM parameters employed by the attack characteristic to implement mitigation measures as hereinbefore described.
Thus
Insofar as embodiments of the disclosure described are implementable, at least in part, using a software-controlled programmable processing device, such as a microprocessor, digital signal processor or other processing device, data processing apparatus or system, it will be appreciated that a computer program for configuring a programmable device, apparatus or system to implement the foregoing described methods is envisaged as an aspect of the present disclosure. The computer program may be embodied as source code or undergo compilation for implementation on a processing device, apparatus or system or may be embodied as object code, for example.
Suitably, the computer program is stored on a carrier medium in machine or device readable form, for example in solid-state memory, magnetic memory such as disk or tape, optically or magneto-optically readable memory such as compact disk or digital versatile disk etc., and the processing device utilizes the program or a part thereof to configure it for operation. The computer program may be supplied from a remote source embodied in a communications medium such as an electronic signal, radio frequency carrier wave or optical carrier wave. Such carrier media are also envisaged as aspects of the present disclosure.
It will be understood by those skilled in the art that, although the present invention has been described in relation to the above described example embodiments, the invention is not limited thereto and that there are many possible variations and modifications which fall within the scope of the invention.
The scope of the present invention includes any novel features or combination of features disclosed herein. The applicant hereby gives notice that new claims may be formulated to such features or combination of features during prosecution of this application or of any such further applications derived therefrom. In particular, with reference to the appended claims, features from dependent claims may be combined with those of the independent claims and features from respective independent claims may be combined in any appropriate manner and not merely in the specific combinations enumerated in the claims.
Number | Date | Country | Kind |
---|---|---|---|
16184383 | Aug 2016 | EP | regional |
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/EP2017/068738 | 7/25/2017 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2018/033350 | 2/22/2018 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
6275536 | Chen et al. | Aug 2001 | B1 |
6546397 | Rempell | Apr 2003 | B1 |
7007301 | Crosbie et al. | Feb 2006 | B2 |
7093750 | Block et al. | Aug 2006 | B1 |
7127461 | Zhu et al. | Oct 2006 | B1 |
7716739 | McCorkendale | May 2010 | B1 |
8479276 | Vaystikh et al. | Jul 2013 | B1 |
8713631 | Pavlyushchik | Apr 2014 | B1 |
8751466 | Tsay | Jun 2014 | B1 |
8806638 | Mani | Aug 2014 | B1 |
8813234 | Bowers | Aug 2014 | B1 |
8898788 | Aziz et al. | Nov 2014 | B1 |
8910238 | Lukacs et al. | Dec 2014 | B2 |
8914406 | Haugsnes et al. | Dec 2014 | B1 |
9009825 | Chang et al. | Apr 2015 | B1 |
9043922 | Dumitras et al. | May 2015 | B1 |
9535727 | Jerbi et al. | Jan 2017 | B1 |
9576137 | Habel et al. | Feb 2017 | B2 |
9626173 | Jurova et al. | Apr 2017 | B1 |
9671816 | Berry | Jun 2017 | B2 |
9807106 | Daniel et al. | Oct 2017 | B2 |
9942267 | Tripathi et al. | Apr 2018 | B1 |
9942268 | Danileiko | Apr 2018 | B1 |
10108803 | Chari | Oct 2018 | B2 |
10747886 | El-Moussa | Aug 2020 | B2 |
11075945 | Ismael | Jul 2021 | B2 |
20010019614 | Madoukh | Sep 2001 | A1 |
20030084349 | Friedrichs et al. | May 2003 | A1 |
20030167421 | Klemm | Sep 2003 | A1 |
20030217053 | Bachman et al. | Nov 2003 | A1 |
20040149818 | Shepley et al. | Aug 2004 | A1 |
20040158741 | Schneider | Aug 2004 | A1 |
20040230834 | McCallam | Nov 2004 | A1 |
20050054268 | Kistler et al. | Mar 2005 | A1 |
20050097146 | Konstantinou et al. | May 2005 | A1 |
20050108562 | Khazan, I et al. | May 2005 | A1 |
20060101401 | Brumme et al. | May 2006 | A1 |
20060103736 | Obrador | May 2006 | A1 |
20060133513 | Kounnas | Jun 2006 | A1 |
20070016953 | Morris et al. | Jan 2007 | A1 |
20070089111 | Robinson et al. | Apr 2007 | A1 |
20070240222 | Tuvell et al. | Oct 2007 | A1 |
20070291791 | English et al. | Dec 2007 | A1 |
20080320594 | Jiang | Dec 2008 | A1 |
20090044024 | Oberheide et al. | Feb 2009 | A1 |
20090055693 | Budko et al. | Feb 2009 | A1 |
20090099860 | Karabulut et al. | Apr 2009 | A1 |
20100011029 | Niemelae | Jan 2010 | A1 |
20100012718 | Griswold et al. | Jan 2010 | A1 |
20100057774 | Pizano et al. | Mar 2010 | A1 |
20100071066 | Kline et al. | Mar 2010 | A1 |
20100138674 | Dimitrakos et al. | Jun 2010 | A1 |
20100162346 | Holostov et al. | Jun 2010 | A1 |
20100175108 | Protas | Jul 2010 | A1 |
20100199351 | Protas et al. | Aug 2010 | A1 |
20100228694 | Le et al. | Sep 2010 | A1 |
20100257608 | Jeong et al. | Oct 2010 | A1 |
20100262873 | Chang et al. | Oct 2010 | A1 |
20100306772 | Arnold et al. | Dec 2010 | A1 |
20100318652 | Samba | Dec 2010 | A1 |
20110004935 | Moffie et al. | Jan 2011 | A1 |
20110023118 | Wright | Jan 2011 | A1 |
20110126110 | Vilke et al. | May 2011 | A1 |
20110138441 | Neystadt et al. | Jun 2011 | A1 |
20110167491 | Ruggerio | Jul 2011 | A1 |
20110197256 | Sharkey et al. | Aug 2011 | A1 |
20110228924 | Tal et al. | Sep 2011 | A1 |
20120030120 | Rosa et al. | Feb 2012 | A1 |
20120081395 | Adi et al. | Apr 2012 | A1 |
20120284794 | Trent et al. | Nov 2012 | A1 |
20120323829 | Stokes | Dec 2012 | A1 |
20120323853 | Fries et al. | Dec 2012 | A1 |
20130006949 | Essawi et al. | Jan 2013 | A1 |
20130024567 | Roxburgh et al. | Jan 2013 | A1 |
20130055398 | Li et al. | Feb 2013 | A1 |
20130097248 | Chakra et al. | Apr 2013 | A1 |
20130232470 | Yung | Sep 2013 | A1 |
20130263125 | Shamsee et al. | Oct 2013 | A1 |
20130333045 | Shigemoto et al. | Dec 2013 | A1 |
20140090008 | Li et al. | Mar 2014 | A1 |
20140107836 | Crews et al. | Apr 2014 | A1 |
20140164251 | Loh | Jun 2014 | A1 |
20140173740 | Albanese et al. | Jun 2014 | A1 |
20140331277 | Frascadore et al. | Nov 2014 | A1 |
20150101055 | Tang et al. | Apr 2015 | A1 |
20150120567 | Van et al. | Apr 2015 | A1 |
20150220735 | Paithane et al. | Aug 2015 | A1 |
20150309780 | Ruehl et al. | Oct 2015 | A1 |
20150312274 | Bishop et al. | Oct 2015 | A1 |
20150332283 | Witchey | Nov 2015 | A1 |
20150378763 | Hassine et al. | Dec 2015 | A1 |
20160019385 | Holt | Jan 2016 | A1 |
20160021122 | Pevny | Jan 2016 | A1 |
20160110192 | Mikkilineni | Apr 2016 | A1 |
20160164894 | Zeitlin et al. | Jun 2016 | A1 |
20160283307 | Takeshima et al. | Sep 2016 | A1 |
20160294875 | Lian et al. | Oct 2016 | A1 |
20160342801 | Sreekanti et al. | Nov 2016 | A1 |
20160366155 | El-Moussa et al. | Dec 2016 | A1 |
20170013000 | El-Moussa et al. | Jan 2017 | A1 |
20170034023 | Nickolov et al. | Feb 2017 | A1 |
20170048252 | Straub et al. | Feb 2017 | A1 |
20170048319 | Straub | Feb 2017 | A1 |
20170103203 | Sharma et al. | Apr 2017 | A1 |
20170104780 | Zaffarano et al. | Apr 2017 | A1 |
20170142133 | Kallos | May 2017 | A1 |
20170223032 | El-Moussa et al. | Aug 2017 | A1 |
20170323113 | El-Moussa et al. | Nov 2017 | A1 |
20170351860 | El-Moussa et al. | Dec 2017 | A1 |
20170351861 | El-Moussa et al. | Dec 2017 | A1 |
20180025166 | Daniel et al. | Jan 2018 | A1 |
20180053002 | El et al. | Feb 2018 | A1 |
20180054451 | El et al. | Feb 2018 | A1 |
20180060575 | El et al. | Mar 2018 | A1 |
20180060581 | El et al. | Mar 2018 | A1 |
20180060582 | El et al. | Mar 2018 | A1 |
20180091531 | El-Moussa et al. | Mar 2018 | A1 |
20180115566 | Azvine et al. | Apr 2018 | A1 |
20180115567 | El-Moussa et al. | Apr 2018 | A1 |
Number | Date | Country |
---|---|---|
2741227 | Jun 2014 | EP |
2750070 | Jul 2014 | EP |
2816469 | Dec 2014 | EP |
WO-0184285 | Nov 2001 | WO |
WO-2009097610 | Aug 2009 | WO |
WO-2012087685 | Jun 2012 | WO |
WO-2013172750 | Nov 2013 | WO |
WO-2014090488 | Jun 2014 | WO |
WO-2015128612 | Sep 2015 | WO |
WO-2015179020 | Nov 2015 | WO |
WO-2016034496 | Mar 2016 | WO |
WO-2017021153 | Feb 2017 | WO |
WO-2017021154 | Feb 2017 | WO |
WO-2017021155 | Feb 2017 | WO |
WO-2017109128 | Jun 2017 | WO |
WO-2017109129 | Jun 2017 | WO |
WO-2017167544 | Oct 2017 | WO |
WO-2017167545 | Oct 2017 | WO |
WO-2018033350 | Feb 2018 | WO |
WO-2018033375 | Feb 2018 | WO |
WO-2018033375 | Mar 2018 | WO |
Entry |
---|
Atoum et al. (Effective Belief Network for Cyber Security Frameworks, International Journal of Security and Its Applications vol. 10, No. 4 (2016), pp. 221-228) (Year: 2016). |
Singhal et al. (Security Risk Analysis of Enterprise Networks Using Probabilistic Attack Graphs, NIST Interagency Report 7788, Aug. 2011, 24 pages) (Year: 2011). |
Xie et al. (Applying Attack Graphs to Network Security Metric, 2009 International Conference on Multimedia Information Networking and Security, 5 pages) (Year: 2009). |
Frigault et al. (Measuring Network Security Using Dynamic Bayesian Network, QoP'08, Oct. 27, 2008, 7 pages) (Year: 2008). |
“A Next-Generation Smart Contract and Decentralized Application Platform” Ethereum White Paper, 2016, retrieved from https://github.com/ethereum/wiki/wiki/White-Paper on Nov. 13, 2018, 40 pages. |
Adler M., “Threat Intelligence Visibility—the way forward,” BT, 2015, available from www.globalservices.bt.com/uk/en/products/assure threat_ monitoring, 8 pages. |
Ahmad S., et al., “How Do Neurons Operate on Sparse Distributed Representations? A Mathematical Theory of Sparsity, Neurons and Active Dendrites,” available from Cornell University Library (citation arXiv: 1601.00720) and https://arxiv.org/ftp/arxiv/papers/1601/1601.00720.pdf, retrieved on Mar. 28, 2018, 23 pages. |
Ahmad S., et al., “Properties of Sparse Distributed Representations and their Application to Hierarchical Temporal Memory,” available from Cornell University Library (citation arXiv: 1503.07469) and https://arx.iv.org/ftp/arx.iv/papers/1503/1503.07469.pdf, retrieved on Mar. 28, 2018, Numenta, Redwood City, CA, USA, Mar. 24, 2015, 18 pages. |
Ahmad S., et al., “Real-Time Anomaly Detection for Streaming Analytics,” available from Cornell University Library (citation arXiv: 1607.02480) and https://arxiv.org/pdf/1607.02480.pdf, retrieved on Mar. 28, 2018, Numenta, Inc., Redwood City, CA, USA, Jul. 8, 2016, 10 pages. |
Anonymous, “Can BitCoin be a better DRM? BitcoinBeginners,” retrieved from https://www.reddit.com/r/BitcoinBeginners/commentsll y5yh8/can bitcoin be_a_better_drm, Feb. 17, 2014, 3 pages. |
Anonymous, “Colored Coins—Bitcoin Wiki,” Retrieved from https://en.bitcoin.it/w/index.php?title=ColoredCoins&oldid=57259, Jul. 7, 2015, 6 pages. |
Anonymous, “Who Will Protect Users From Ethereum Based Malware?: Ethereum,” Mar. 28, 2016, Retrieved from https://www.reddit.com/r/ethereum/comments/4ccfaa/who_will_protect_users_from_ethereum_based_malware/?st=itbp2q49&sh=d8cc4355 on Nov. 13, 2018, 3 pages. |
Antonopoulos A M., “Mastering Bitcoin—Unlocking Digital Crypto-Currencies,” Early Release Raw & Unedited, ISBN: 978-1-449-37404-4; retrieved from: https://unglueitfiles.s3.amazonaws.com/ebf/05db7df4f31840f0a873d6ea14dcc28d.pdf, Dec. 2014, 282 pages. |
Asmi E.A.K., et al., “Bitcoin-Based Decentralized Carbon Emissions Trading Infrastructure Model,” Systems Engineering, Mar. 2015, vol. 18 (2), Retrieved from the Internet: URL: https://www.researchgate.net/publication/268686553, 15 pages. |
Assia Y., et al., “Colored Coins Whitepaper,” 2015, available at docs.google.com/document/d/1AnkPcVZTCMLizw4DvsW6M8Q2JCOllzrTLuoWu2z1BE, 23 pages. |
Benders J.F., “Partitioning Procedures for Solving Mixed Variables Programming Problems,” 1962, vol. 4, pp. 238-252. |
Billaudelle S., et al., “Porting HTM Models to the Heidelberg Neuromorphic Computing Platform,” available from Cornell University Library (citation arXiv: 1505. 02142), retrieved on Mar. 28, 2018, from https://arx.iv.org/pdf/1505.02142.pdf, Kirchhoff-Institute for Physics, May 2015, 9 pages. |
Biryukov A., et al., “R&D in Smart Contracts, Cryptocurrency and Blockchain,” University of Luxembourg, Jan. 19, 2016, XP055306767, Retrieved from http://wwwfr.uni.lu/snt/news_events/speaker_s_presentations on Sep. 29, 2016, pp. 51 pages. |
Bonneau J., et al., “Research Perspectives and Challenges for Bitcoin and Cryptocurrencies,” International Association for Cryptologic Research, Mar. 19, 2015, 18 pages. |
Chaisiri, “Optimization of Resource Provisioning Cost in Cloud Computing,” IEEE Transactions on Services Computing, Apr.-Jun. 2012, vol. 5 (2), 14 pages. |
Chen E., “Introduction To Restricted Boltzmann Machines,” Jul. 18, 2011; 5 pages. |
Cruz J.P., et al., “The Bitcoin Network as Platform for TransOrganizational Attribute Authentication,” WEB 2015, The Third International Conference on Building and Exploring Web Based Environments, XP055239598, Rome, Italy, 2015, 7 pages. |
Cui, et al., “Continuous Online Sequence Learning with an Unsupervised Neural Network Model,” Published in Neural Computation and available from https://www.mitpressjournals.org/doi/pdf/10.1162/NECOa_00893, retrieved on Mar. 28, 2018, Numenta Inc., Redwood City, CA, USA, Nov. 2016, vol. 28 (11), 31 pages. |
Cui, et al., “The HTM Spatial Pooler: A Neocortical Algorithm for Online Sparse Distributed Coding,” available from Cold Spring Harbor Laboratory bioRxiv (citation doi.org/10.1101/085035) and https://www.biorxiv.org/content/biorxiv/early/2017/02/16/085035.full.pdf, retrieved on Mar. 28, 2018, Numenta Inc., Redwood City, CA, USA, Feb. 3, 2017, 16 pages. |
CVE Details The Ultimate Security Vulnerability Datasouce, “Current CVSS Score Distribution For All Vulnerabilities” retrieved from https://www.cvedetails.com/ on Jun. 28, 2018, 1 page. |
Czepluch J.S., et al., “The Use of Block Chain Technology in Different Application Domains,” XP055242451, retrieved from http://http://www.Iollike.org/bachelor.pdf, May 20, 2015, 109 pages. |
Dewri R., et al., “Optimal Security Hardening using Multi-Objective Optimization on Attack Tree Models of Networks,” CCS '07, ACM, Oct. 29-Nov. 2, 2007, pp. 204-213. |
DMTF, “Open Virtualization Format Specification,” Document No. DSP0243, Version: 1.1.0, Jan. 12, 2010, 42 pages. |
Dr Gavin Wood, “Ethereum: A Secure Decentralize Generalized Transaction Ledger,” EIP-150 Revision, Retrieved from http://gavwood.com//paper.pdf, Jun. 4, 2014, 32 pages. |
European Search Report for Application No. 16184381.8, dated Feb. 16, 2017, 10 pages. |
European Search Report for Application No. 16184384.2, dated Feb. 16, 2017, 74 pages. |
European Search Report for Application No. 16184385.9, dated Feb. 24, 2017, 61 pages. |
Extended European Search Report for Application No. EP14275221.1, dated Jan. 7, 2015, 6 pages. |
Extended European Search Report for Application No. EP15179440.1, dated Feb. 10, 2016, 6 pages. |
First.org, Inc., “Common Vulnerability Scoring System, V3 Development Update,” available at www.first.org/cvss, CVSS v3.0 User Guide (v1.5), 15 pages. |
Fischer A., et al., “An Introduction to Restricted Boltzmann Machines,” in: Progress in Pattern Recognition, Image Analysis, Computer Vision and Applications, vol. 7441 of the series Lecture Notes in Computer Science, 2012, pp. 14-36. |
Fischer A., et al., “Training restricted Boltzmann machines: An introduction,” Pattern Recognition, vol. 47, No. 1, 2014, pp. 25-39. |
Frigault M., “Measuring Network Security Using Bayesian Network-Based Attack Graphs,” The Concordia Institute of Information systems Engineering, Mar. 2010, 88 pages. |
Grushack J., et al., “Currency 3.0, Examining Digital Crypto Currency Markets,” Union College, XP055242356, Retrieved from http://antipasto.union.edu/engineering/Archives/SeniorProjects/2014/CS.2014/files/grushacj/grushacj_paper.pdf, Jun. 2014, 44 pages. |
Hawkins, et al., “Why Neurons Have Thousands of Synapses, A Theory of Sequence Memory in Neocortex,” Published in Frontiers in Neural Circuits (10 (2016) 1-13, doi:I0.3389/fncir.2016.00023) and available from https://www.frontiersin.org/articlesII0.3389/fncir.2016.00023/full, retrieved on Mar. 28, 2018, Numenta Inc., Redwood City, CA, USA, Mar. 30, 2016, 13 pages. |
Hawkins, et al., in “On Intelligence, How a New Understanding of the Brain Will Lead to the Creation of Truly Intelligent Machines,” 2004, Times Books, ISBN 0-8050-7 456-2, Jul. 14, 2005, 174 pages. |
Hinton G., “A Beginner's Tutorial For Restricted Boltzmann Machines,” https://deeplearning4j.org/restrictedboltzmannmachine.html, Aug. 31, 2018, 16 pages. |
Hinton G., “A Practical Guide To Training Restricted Boltzmann Machines,” Department of Computer Science, UTML TR 2010-003, Aug. 2, 2010, Version 1, 21 pages. |
U.S. Appl. No. 16/065,637, filed Jun. 22, 2018, 166 pages, Inventor(s): El-Moussa et al. |
International Preliminary Report on Patentability for Application No. PCT/EP2015/074970, dated May 11, 2017, 10 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2015/080244, dated Jul. 13, 2017, 8 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2015/080246, dated Jul. 13, 2017, 8 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2016/067308, dated Feb. 15, 2018, 7 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2016/067309, dated Feb. 15, 2018, 7 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2016/067310, dated Feb. 15, 2018, 8 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/EP2016/082476, dated Feb. 9, 2017, 8 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/EP2016/082477, dated Feb. 22, 2017, 8 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2016/082476, dated Jul. 5, 2018, 7 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2016/082477, dated Jul. 5, 2018, 7 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055081, dated Oct. 11, 2018, 9 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055082, dated Oct. 11, 2018, 8 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055090, dated Oct. 11, 2018, 10 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055091, dated Oct. 11, 2018, 9 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055094, dated Oct. 11, 2018, 8 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2015/074970, dated Jan. 25, 2016, 11 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2015/080244, dated Mar. 24, 2016, 9 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2015/080246, dated Mar. 14, 2016, 10 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2016/067309, dated Nov. 3, 2016, 9 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2016/067310, dated Sep. 22, 2016, 9 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055081, dated Apr. 7, 2017, 11 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055082, dated Apr. 26, 2017, 9 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055090, dated Jun. 14, 2017, 12 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055091, dated Apr. 11, 2017, 11 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055094, dated May 15, 2017, 10 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/055095, dated Apr. 11, 2017, 10 pages. |
International Search Report and Written Opinion for Application No. PCT/EP2017/069272, dated Feb. 20, 2018, 13 pages. |
International Search Report and Written Opinion for Application No. PCT/US2017/046927, dated Oct. 13, 2017, 13 pages. |
International Search Report and Written Opinion for PCT Application No. PCT/EP2016/067308, dated Sep. 21, 2016, 8 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/055095, dated Oct. 11, 2018, 8 pages. |
Lavin, et al., “Evaluating Real-time Anomaly Detection Algorithms, the Numenta Anomaly Benchmark,” available from Cornell University Library (citation archive:1510.03336) https://arxiv.org/ftp/arxiv/papers/1510/1510.03336.pdf, retrieved on Mar. 28, 2018, Numenta, Inc., Redwood City, CA, USA, Oct. 9, 2015, 8 pages. |
Miller A., “The State-of-the-Art of Smart Contracts,” FinTech R&D Innovation Conference, Luxemburg, Jan. 19, 2016, Retrieved from URL: http://wwwfr.uni.lu/snt/news_events/speaker_s_presentations on Sep. 29, 2016, 29 pages. |
Munoz-Gonzalez, “Exact Inference Techniques for the Dynamic Analysis of Bayesian Attack Graphs,” Imperial college, London, Oct. 2015, 14 pages. |
Numenta, “Biological and Machine Intelligence (BAMI), A living book that documents Hierarchical Temporal Memory (HTM),” Numenta, Inc., Mar. 8, 2017, retrieved on Mar. 28, 2018 from https://numenta.com/assets/pdf/biological-and-machine-intelligence/BAMIComplete.pdf, 69 pages. |
Numenta, “Hierarchical Temporal Memory including HTM Cortical Learning Algorithms,” Version 0.2.1, Numenta, Sep. 12, 2011, 68 pages. |
Numenta, “Sparse Distributed Representations,” (Numenta, available from https://numenta.com/assets/pdf/biological-and-machine-intelligence/BaMISDR.pdf and accessed on Mar. 29, 2017, retrieved on Mar. 28, 2018, 15 pages. |
Olshausen, et al., “Sparse Coding with an Overcomplete Basis Set, A Strategy Employed by VI?,” Olshausen, B.A., Field, D.J., 1997, Vision Research, 37:3311-3325) retrieved on Mar. 28, 2018 from http://www.chaos.gwdg.de/michael/CNScourse_2004/papersmax/OlshausenFieldl997.pdf, Dec. 24, 1996, 15 pages. |
OPNET Technologies Network Simulator I Riverbed, retrieved from https ://www. riverbed.com/products/ steel central/ opnet.html ?redirect=opnet on Jun. 28, 2018, 5 pages. |
Plohmann D., et al., “Case study of the Miner Botnet,” 4TH International Conference on Cyber Conflict, Jun. 5, 2012, pp. 345-360. |
Purdy S., “Encoding Data for HTM Systems,” Available from Cornell University Library (citation arXiv: 1602.05925), retrieved on Mar. 28, 2018 from https://arx.iv.org/ftp/arx.iv/papers/1602/1602.05925.pdf, Numenta, Inc., Redwood City, California, USA, Feb. 2016, 11 pages. |
Rosenfeld M., “Overview of Colored Coins,” https:1/bravenewcoin.com/assets/Whitepapers/Overview-of-Colored-Coins.pdf, Dec. 4, 2012, 13 pages. |
Search Report for Great Britain Application No. 1614013.9, dated Feb. 3, 2017, 4 pages. |
Search Report for Great Britain Application No. 1614016.2, dated Feb. 3, 2017, 5 pages. |
Search Report for Great Britain Application No. 1614018.8, dated Feb. 7, 2017, 7 pages. |
Shah S.Y., et al., “Price Based Routing for Event Driven Prioritized Traffic in Wireless Sensor Networks,” Apr. 29-May 1, 2013, IEEE 2nd Network Science Workshop, XP032487185, 8 pages. |
Skybox Security; Cybersecurity Management & Analytics retrieved from https://www.skyboxsecurity.com/ on Jul. 12, 2018, 7 pages. |
Sood A.K., et al., “An Empirical Study of HTTP-based Financial Botnets,” IEEE Transactions on Dependable and Secure Computing, IEEE Service Center, New York, NY, US, vol. 13 (2), Mar. 2016, pp. 236-251. |
Tschorsch F., et al., “Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies,” International Association for Cryptologic Research, May 15, 2015, pp. 1-37. |
Wang Z., “The Applications of Deep Learning on Traffic Identification,” 2012, Advances in Neural Information Processing Systems, 2015, 10 pages. |
Wikipedia, “Blockchain (database)—Wikipedia,” Nov. 29, 2015, retrieved from https://en.wikipedia.org/w/index.php?title=Block_chain_(database)&oldid=692921608 on Nov. 13, 2018, pp. 1-5. |
Application and Filing Receipt for U.S. Appl. No. 15/541,089, filed Jun. 30, 2017, Inventor(s): El-Moussa et al. |
Application and Filing Receipt for U.S. Appl. No. 15/541,128, filed Jun. 30, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 16/319,391, filed Jan. 21, 2019, Inventors: El-Moussa et al. |
Application and Filing Receipt for U.S. Appl. No. 16/065,637, filed Jun. 22, 2018, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,288, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,298, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,312, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,322, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,336, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
U.S. Appl. No. 15/677,363, filed Aug. 15, 2017, Inventor(s): El-Moussa et al. |
Application and Filing Receipt for U.S. Appl. No. 16/065,665, filed Jun. 22, 2018, Inventor(s): El-Moussa et al. |
Application and Filing Receipt for U.S. Appl. No. 15/521,964, filed Apr. 26, 2017, Inventor(s): El-Moussa et al. |
International Search Report and Written Opinion for corresponding PCT Application No. PCT/EP2017/068738 dated Oct. 9, 2017; 13 pages. |
Fischer, et al.; “Training Restricted Boltzmann Machines: An Introduction”, vol. 47, No. 1, Jun. 7, 2013, 27 pages. |
International Preliminary Report on Patentability for Application No. PCT/EP2017/068738, dated Feb. 28, 2019, 10 pages. |
Office Action dated Mar. 29, 2019 for U.S. Appl. No. 16/065,665, 27 pages. |
Office Action dated Jul. 30, 2019 for U.S. Appl. No. 16/065,665, 27 pages. |
Response to Jul. 30, 2019 Office Action, U.S. Appl. No. 16/065,665, filed Oct. 30, 2019, 10 pages. |
Response to Mar. 29, 2019 Office Action for U.S. Appl. No. 16/065,665, filed Jun. 28, 2019, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20190188392 A1 | Jun 2019 | US |