This invention relates generally to the authentication field, and more specifically to a new and useful method for key rotation.
Passwords are easily phished, captured, replayed, or otherwise compromised. To address weaknesses in passwords, two-factor authentication was developed and now is commonly deployed by websites and companies. Most two-factor authentication systems operate by adding an additional security challenge after prompting a user for primary password-based authentication.
One model of two-factor authentication utilizes one-time passcodes (OTPs). In this model, the user employs an OTP-generating device to generate a short, user friendly passcode (usually 6 or 8 numeric digits) and then provides that passcode to the validating service (usually by typing it in to an input box).
The OTP-generating device and the validating server both share a secret and employ an algorithm that allows them to agree upon what passcode to expect. OATH HOTP and TOTP are two open standards for OTP-based authentication.
Due to the nature of OTP-based authentication standards, OTP authentication requires the use of symmetric cryptography; therefore, both the validating server and the OTP-generating device must store the same symmetric cryptographic key. Unfortunately, this means that if the validating server is compromised, every device capable of validating with the server is at risk. Thus, there is a need in the authentication field to create a new and useful method for key rotation. This invention provides such a new and useful method.
The following description of preferred embodiments of the invention is not intended to limit the invention to these preferred embodiments, but rather to enable any person skilled in the art to make and use this invention.
As shown in
As described in the background section, while one-time passcode (OTP) authentication methods are commonly used to perform multi-factor authentication, they are vulnerable to authentication server attacks. This vulnerability arises from the need to maintain symmetric encryption; because the authentication server has the same key as the OTP-generating device (e.g., a smartphone), anyone with access to that key can authenticate as the user. In this scenario, while compromise of a user's OTP-generating device might expose only data and services accessible to that particular user, compromise of an authentication server can expose data and services for all OTP-generating devices capable of authenticating with the server. The result of this is potentially catastrophic.
Methods have been developed to address this issue; for example, the push authentication technique of U.S. patent application Ser. No. 13/039,209, the entirety of which has been incorporated by this reference. As shown in
While push authentication lacks the server-side vulnerability of OTP-based authentication, it still requires a device capable of receiving a push notification as well as a network connection to that device. In contrast, the shared secret of the OTP authentication algorithm may allow a user to authenticate, for example, by typing in a short numeric code displayed on an authenticating device (e.g., a smartphone, a hardware security token) into a login prompt manually. In some cases (e.g., when authenticating devices do not have network connectivity) users may need to authenticate using an OTP algorithm, despite the security vulnerabilities inherent in any OTP implementation.
Unfortunately, for a multi-factor authentication platform to be inclusive of OTP authentication, the platform must be exposed to at least some amount of risk of large-scale symmetric key compromise. The method 100 functions to mitigate that risk.
More specifically, the method 100 may function to mitigate the risk of large scale symmetric key compromise by enabling a multi-factor authentication platform to rapidly perform key rotation; thus, if a large number of symmetric keys are compromised, the method 100 can quickly enable those keys to be deactivated while minimizing disruption in service (by providing new keys).
This is a substantial departure from traditional methods for key rotation utilized for OTP authentication. Typically, TOTP (and other OTP applications) perform key rotation by requiring a user or administrator to enter a shared secret at an OTP application; this is typically displayed as a QR code and/or a numerical code at a computer accessed by a user, a user may take a picture of the QR code or enter the numerical code into the OTP application to establish the shared secret. These traditional methods suffer from a number of problems—as they are inherently manual, they can be very slow; further, this delay may cause either or both of extreme inconvenience and substantial security risks.
While the method 100 is particularly useful for the replacement of symmetric keys used in OTP authentication, the method 100 may also be used to replace asymmetric keys (such as those used for push authentication) in case of suspected compromise of a device. Alternatively, the method 100 may be used in any cryptographic key management scenario.
The method 100 is preferably implemented by a two-factor authentication system, but may additionally or alternatively be implemented with any multi-step and/or multi-factor authentication systems.
Note that while the authentication platform operating the method 100 preferably allows users to authenticate using either of OTP-based authentication and push-based authentication (or another asymmetric-encryption based auth. technique), the platform may in some cases only allow users to perform a particular authentication technique depending on authentication context. As a first example, a user may perform push auth for any authentication event, but may only perform OTP auth for low-security access (while push auth may be required for access to applications or data considered ‘high-security’). As a second example, a user may perform OTP auth only if the user's authenticating device is not able to access the authentication platform via a network connection. As a third example, a user may only perform OTP auth if the user is attempting to access a service from a particular location (e.g., as determined via a GPS signal of the authenticating device, as determined via an IP address of a primary access point, etc.). As a fourth example, a user may only perform OTP auth only if OTP auth has been explicitly enabled for that user by a service provider or authentication platform administrator. In general, the types of authentication available may be modified or made conditionally available on any security or contextual data affecting authentication data. Further examples of such conditions may be found in U.S. Provisional Application No. 62/344,512, the entirety of which is incorporated by this reference.
The method 100 is preferably performed by an authenticating device (i.e., a device used as an authentication factor) and/or an authentication server, but may additionally or alternatively be performed by any suitable components of a two-factor or multi-factor authentication system. For example, the function of the authentication server may be distributed across a distributed computing network.
Authenticating devices are preferably network-connected (where network connected means at least able to communicate with the authentication server) mobile electronic devices capable of receiving push notifications (e.g., smartphones), but may additionally or alternatively be any suitable authenticating device capable of generating a one-time password. Examples of authenticating devices include desktop computers, servers, smartphones, tablets, laptops, media players, cameras, measurement devices, gaming systems, security tokens, vehicular computing devices, set-top boxes, and/or televisions.
S110 includes initiating key rotation. S110 functions to alert the authentication server and at least one authenticating device that one or more authentication keys need to be rotated (i.e., replaced).
S110 preferably includes receiving, at the authentication server and/or at an authenticating device, a key rotation request from an authentication system user or administrator. Key rotation requests preferably indicate the keys that need to be replaced (e.g., the symmetric key for device 1, the asymmetric key pair for device 2, etc.), but may additionally or alternatively include any suitable information. For example, a system administrator of a 2FA platform may request key rotation for all keys associated with a database of a compromised server.
Key rotation requests are preferably evaluated according to initiator privilege. For example, an authentication system user may be able to request only key rotation for his/her devices (alternatively, an authentication system user without additional privileges may not be able to make a key rotation request at all). As a second example, a system administrator for a company may be able to request key rotation for all devices associated with the company. As a third example, a system administrator for the authentication system may be able to request key rotation for any key associated with the system (or with a particular authentication server/database).
S110 may additionally or alternatively include receiving, at the authentication server and/or at an authenticating device, an automatically generated key rotation request (e.g., from a security server). For example, an automated security monitoring module may detect suspicious activity occurring with a large number of devices associated with symmetric keys accessible to the authentication server and automatically generate a key rotation request.
S110 may additionally or alternatively include initiating, at the authentication server and/or at an authenticating device, key rotation without receiving an external key rotation request. For example, S110 may include automatically initiating symmetric key rotation every three months (or every 25 logins) after initial key generation.
S110 preferably includes initiating key rotation by setting a key rotation flag in an authentication server-side database and then transmitting that flag to the authenticating device, as shown in
Additionally or alternatively, key rotation flags may be set in any location accessible to the authentication server and/or the authenticating device.
If key rotation is initiated by the entity responsible for generating the new key(s), S110 may include proceeding to key generation (S120) before notifying the other entity that key rotation is to take place. For example, if key generation occurs on the authenticating device and key rotation is initiated by the authenticating device, the authenticating device may generate a key or key pair before notifying the authentication server that key rotation is requested.
If keys are generated before notification of both parties (i.e., authenticating device and authentication server), the key generating party may notify the other party of key rotation by sending the newly generated key (instead of a key rotation flag or other notification). Additionally or alternatively, the key generating party may first send a key rotation notification before transmitting the new key. If a key rotation notification is sent, the sending party may additionally or alternatively wait for confirmation before proceeding.
In a variation of a preferred embodiment, S110 may include attempting to verify, at one or both authenticating party, that key rotation requests are authentic (e.g., that an authentication device is not being spoofed) before requesting key generation. For example, S110 may include requesting additional information or analyzing operational data with behavioral heuristics. Authenticity may be verified against a database of known authentication factors or an authentication algorithm; additionally or alternatively, authenticity may be verified in any suitable manner. For example, if a device has been previously authenticated, S110 may include recognizing a cookie or other token of previous authentication.
S120 includes generating keys. S120 functions to generate keys in response to a key rotation request. S120 preferably includes generating keys at the authenticating device, but may additionally or alternatively include generating keys at the authentication server or any other entity.
S120 preferably includes generating keys according to a particular specification in a key rotation request (i.e., the key rotation request specifies the keys to be generated). Additionally or alternatively, S120 may generate keys according to a default setting (e.g., all keys used by a particular authenticating device, all symmetric keys contained on an authentication server, etc.) or based on any other criteria.
S120 preferably may generate keys using algorithms intended for asymmetric-key cryptography algorithms (e.g., RSA) as well as key generation algorithms intended for symmetric-key cryptography (e.g., DES and AES), but may additionally or alternatively generate keys in any manner.
S120 preferably utilizes random number generators (RNGs) or pseudo-random number generators (PRNGs) in the key generation process. If a key generating entity has a hardware RNG, S120 preferably includes using this RNG, but may additionally or alternatively use any suitable RNG or PRNG. If a key generating entity does not have a dedicated RNG, but is capable of providing potential RNG sources (e.g., radio noise, thermal noise), the entity preferably uses the RNG sources to generate random numbers. S120 may include performing any suitable signal processing on RNG sources to extract random numbers, including the use of randomness extractors. If a key generating entity does not have access to RNG sources, S120 preferably includes generating pseudo-random numbers using a PRNG. The PRNG preferably runs on general purpose computing hardware of the electronic device (e.g., a main CPU), but may additionally or alternatively run on more specialized hardware (e.g., a GPU, or hardware dedicated to security functions). Additionally or alternatively, S120 may include receiving random numbers from an external source (e.g., from an internet-connected random number generator).
S120 preferably includes storing keys after key generation. Keys may be stored either temporarily or semi-permanently depending on intended use; for example, if an authenticating device generates both a symmetric key and an asymmetric key pair, the device may store both the symmetric key and the private key of the asymmetric key pair semi-permanently, while it may only store the public key of the asymmetric key pair until it has been successfully transmitted to the authentication server.
S130 includes distributing keys. S130 functions to distribute keys generated in S120 to the authentication server and authenticating devices.
S130 preferably includes transmitting keys from the authenticating device to the authentication server, but may additionally or alternatively include transmitting keys from any source to any destination.
If an asymmetric key pair was generated in S120 (e.g., for push authentication), S130 preferably includes transmitting the public key of the asymmetric key pair across the network (e.g., from the authenticating device to the authentication server). This prevents the private key from being exposed to the network. Additionally or alternatively, S130 may include transmitting the private key of the asymmetric key pair across the network (e.g., from the authentication server to the authenticating device). This alternative may be used if the authenticating device is not capable of generating an appropriate asymmetric key pair (e.g., if it does not have strong cryptography libraries, no source of random number generation, etc.).
If a symmetric key was generated in S120 (e.g., for OTP authentication), S130 preferably includes transmitting the symmetric key across the network (e.g., from the authenticating device to the authentication server). Additionally or alternatively, the method 100 may include cooperating between the authentication server and the authenticating device to jointly arrive at a shared symmetric key according to a secure key-exchange algorithm (e.g., Diffie-Hellman); this would combine elements of S120 and S130.
If the symmetric key is transmitted from the authentication server to the authenticating device, S130 may include encrypting the symmetric key before transmission with the public key corresponding to a private key held by the authenticating device (it can then be decrypted by the authenticating device). This may be useful if the symmetric key and/or public key were potentially compromised (e.g., via server exploit), but not the private key.
If keys are transmitted from the authenticating device to the authentication server, S130 preferably includes signing the key transmission using the private key of the authenticating device. Note that the signing private key referenced here is the one corresponding to a public key held by the authentication server before key transmission; that is, if a new asymmetric key pair is transmitted, the transmission is signed by the old private key (as opposed to the new one). Additionally or alternatively, S130 may include signing the key transmission (or otherwise providing evidence of authenticity) in any suitable manner.
If keys are transmitted from the authentication server to the authenticating device, S130 preferably includes signing the key transmission using the public key of the authentication server. Note that the signing public key referenced here is the one corresponding to a private key held by the authenticating device before key transmission; that is, if a new asymmetric key pair is transmitted, the transmission is signed by the old public key (as opposed to the new one). Additionally or alternatively, S130 may include signing the key transmission (or otherwise providing evidence of authenticity) in any suitable manner.
If the authenticating device and authentication server do not already share an asymmetric key pair, the key transmission may be signed using the symmetric key (or may be accompanied by a set of one-time passwords generated by the symmetric key). Additionally or alternatively, the authentication server (and/or auth. device) may use heuristics or an identification algorithm to authenticate the transmission. For example, an authentication server may choose to accept a key transmission from an authenticating device if the key transmission originates from a user and IP address frequently associated with that authenticating device in the past. S130 may include attempting to authenticate or verify a key transmission in any manner.
After key transmission, S130 preferably includes configuring the authenticating device and authentication server to use newly generated keys and disposing of old keys and/or temporarily stored keys (e.g., a public key stored on the authenticating device). Additionally or alternatively, S130 may include waiting until conclusion of key pair operation verification (S140) to reconfigure authentication and/or dispose of keys. Note that key operation may be reconfigured in any manner; for example, there may be a grace period (e.g., old keys are allowed to be used for a certain period of time after key rotation is initiated; old keys may be used for low-security access; or a combination of the two).
S140 includes verifying new key operation. S140 functions to confirm that a new authentication configuration (e.g., new keys) is operating correctly. S140 preferably includes receiving a follow-up request signed with newly distributed keys or other confirmation. For example, S140 may include receiving a message signed with a new symmetric key at the authenticating device after transmitting a new symmetric key from the authenticating device to the authentication server. S140 may additionally or alternatively include verifying new key operation in any manner.
As discussed in S130, verification under S140 may include prompting configuration changes (e.g., configure auth. system to use new keys if verified successfully, falling back to old keys/initiating a new keygen process if not) and/or key disposal (e.g., removing old keys and/or temporarily stored keys).
An example implementation of the method 100 is as shown in
The method of the preferred embodiment and variations thereof can be embodied and/or implemented at least in part as a machine configured to receive a computer-readable medium storing computer-readable instructions. The instructions are preferably executed by computer-executable components preferably integrated with a multi-factor authentication service. The computer-readable medium can be stored on any suitable computer-readable media such as RAMs, ROMs, flash memory, EEPROMs, optical devices (CD or DVD), hard drives, floppy drives, or any suitable device. The computer-executable component is preferably a general or application specific processor, but any suitable dedicated hardware or hardware/firmware combination device can alternatively or additionally execute the instructions.
As a person skilled in the art will recognize from the previous detailed description and from the figures and claims, modifications and changes can be made to the preferred embodiments of the invention without departing from the scope of this invention defined in the following claims.
This application is a continuation of U.S. Pat. No. 9,774,579, filed 27 Jun. 2016, which claims the benefit of U.S. Provisional Application No. 62/197,316, filed 27 Jul. 2015, both of which are incorporated in their entireties by this reference.
Number | Name | Date | Kind |
---|---|---|---|
5838792 | Ganesan | Nov 1998 | A |
5870723 | Pare, Jr. et al. | Feb 1999 | A |
6119096 | Mann et al. | Sep 2000 | A |
6209091 | Sudia et al. | Mar 2001 | B1 |
6311272 | Gressel | Oct 2001 | B1 |
6694025 | Epstein et al. | Feb 2004 | B1 |
6758394 | Maskatiya et al. | Jul 2004 | B2 |
6823359 | Heidingsfeld et al. | Nov 2004 | B1 |
6934858 | Woodhill | Aug 2005 | B2 |
6956950 | Kausik | Oct 2005 | B2 |
6996716 | Hsu | Feb 2006 | B1 |
7000247 | Banzhof | Feb 2006 | B2 |
7093133 | Hopkins et al. | Aug 2006 | B2 |
7096354 | Wheeler et al. | Aug 2006 | B2 |
7107246 | Wang | Sep 2006 | B2 |
7146009 | Andivahis et al. | Dec 2006 | B2 |
7172115 | Lauden | Feb 2007 | B2 |
7331518 | Rable | Feb 2008 | B2 |
7334255 | Lin et al. | Feb 2008 | B2 |
7340600 | Corella | Mar 2008 | B1 |
7386720 | Sandhu et al. | Jun 2008 | B2 |
7447784 | Eun | Nov 2008 | B2 |
7463637 | Bou-Diab et al. | Dec 2008 | B2 |
7496662 | Roesch et al. | Feb 2009 | B1 |
7526792 | Ross | Apr 2009 | B2 |
7562382 | Hinton et al. | Jul 2009 | B2 |
7562385 | Thione et al. | Jul 2009 | B2 |
7571471 | Sandhu et al. | Aug 2009 | B2 |
7574733 | Woodhill | Aug 2009 | B2 |
7599493 | Sandhu et al. | Oct 2009 | B2 |
7630493 | Sandhu et al. | Dec 2009 | B2 |
7711122 | Allen et al. | May 2010 | B2 |
7716240 | Lim | May 2010 | B2 |
7764970 | Neil et al. | Jul 2010 | B2 |
7793110 | Durfee et al. | Sep 2010 | B2 |
7836501 | Sobel et al. | Nov 2010 | B2 |
7953979 | Borneman et al. | May 2011 | B2 |
7958362 | Hwang | Jun 2011 | B2 |
7961645 | Gudipudi et al. | Jun 2011 | B2 |
7982595 | Hanna et al. | Jul 2011 | B2 |
7983987 | Kranzley et al. | Jul 2011 | B2 |
8010779 | Sermersheim et al. | Aug 2011 | B2 |
8028329 | Whitcomb | Sep 2011 | B2 |
8099368 | Coulter et al. | Jan 2012 | B2 |
8136148 | Chayanam et al. | Mar 2012 | B1 |
8141146 | Ozeki | Mar 2012 | B2 |
8151333 | Zhu et al. | Apr 2012 | B2 |
8161527 | Curren | Apr 2012 | B2 |
8185744 | Brown et al. | May 2012 | B2 |
8200980 | Robinson et al. | Jun 2012 | B1 |
8225392 | Dubrovsky et al. | Jul 2012 | B2 |
8245044 | Kang | Aug 2012 | B2 |
8259947 | Rose et al. | Sep 2012 | B2 |
8332627 | Matthews et al. | Dec 2012 | B1 |
8335933 | Humphrey et al. | Dec 2012 | B2 |
8340287 | Sandhu et al. | Dec 2012 | B2 |
8340635 | Herz et al. | Dec 2012 | B2 |
8380192 | Kim et al. | Feb 2013 | B2 |
8381297 | Touboul | Feb 2013 | B2 |
8397301 | Hering et al. | Mar 2013 | B2 |
8402526 | Ahn | Mar 2013 | B2 |
8418168 | Tyhurst et al. | Apr 2013 | B2 |
8458798 | Williams et al. | Jun 2013 | B2 |
8484708 | Chern | Jul 2013 | B2 |
8495720 | Counterman | Jul 2013 | B2 |
8499149 | Chen | Jul 2013 | B2 |
8499339 | Chao et al. | Jul 2013 | B2 |
8510820 | Oberheide et al. | Aug 2013 | B2 |
8522010 | Ozzie et al. | Aug 2013 | B2 |
8528039 | Chakarapani | Sep 2013 | B2 |
8538028 | Yeap et al. | Sep 2013 | B2 |
8539544 | Garimella et al. | Sep 2013 | B2 |
8539567 | Logue et al. | Sep 2013 | B1 |
8548426 | Smith | Oct 2013 | B2 |
8571220 | Ollikainen et al. | Oct 2013 | B2 |
8578162 | Jentzsch et al. | Nov 2013 | B2 |
8595822 | Schrecker et al. | Nov 2013 | B2 |
8601554 | Gordon et al. | Dec 2013 | B2 |
8612305 | Dominguez et al. | Dec 2013 | B2 |
8627438 | Bhimanaik | Jan 2014 | B1 |
8646060 | Ben Ayed | Feb 2014 | B1 |
8646086 | Chakra et al. | Feb 2014 | B2 |
8667288 | Yavuz | Mar 2014 | B2 |
8689287 | Bohmer et al. | Apr 2014 | B2 |
8700729 | Dua | Apr 2014 | B2 |
8713329 | Schneider | Apr 2014 | B2 |
8713639 | Cheeniyil et al. | Apr 2014 | B2 |
8719930 | Lapsley et al. | May 2014 | B2 |
8732475 | Fahrny et al. | May 2014 | B2 |
8732839 | Hohl | May 2014 | B2 |
8737623 | Hart | May 2014 | B2 |
8745703 | Lambert et al. | Jun 2014 | B2 |
8751801 | Harris et al. | Jun 2014 | B2 |
8756567 | Jentsch et al. | Jun 2014 | B2 |
8756651 | Baer et al. | Jun 2014 | B2 |
8756698 | Sidagni | Jun 2014 | B2 |
8763077 | Oberheide et al. | Jun 2014 | B2 |
8806609 | Gladstone et al. | Aug 2014 | B2 |
8850516 | Hrebicek et al. | Sep 2014 | B1 |
8862097 | Brand et al. | Oct 2014 | B2 |
8891772 | D Souza et al. | Nov 2014 | B2 |
8893230 | Oberheide et al. | Nov 2014 | B2 |
8898762 | Kang | Nov 2014 | B2 |
8949596 | Yin et al. | Feb 2015 | B2 |
8949927 | Arnott et al. | Feb 2015 | B2 |
8966587 | Nair et al. | Feb 2015 | B2 |
8984276 | Benson et al. | Mar 2015 | B2 |
9037127 | Raleigh | May 2015 | B2 |
9049011 | Agrawal | Jun 2015 | B1 |
9049594 | Chen et al. | Jun 2015 | B2 |
9071611 | Yadav et al. | Jun 2015 | B2 |
9076343 | Chaar et al. | Jul 2015 | B2 |
9110754 | Poonamalli et al. | Aug 2015 | B2 |
9118656 | Ting et al. | Aug 2015 | B2 |
9122888 | Devi | Sep 2015 | B2 |
9124582 | Kalinichenko et al. | Sep 2015 | B2 |
9135458 | Hankins, Jr. et al. | Sep 2015 | B1 |
9154387 | Maki et al. | Oct 2015 | B2 |
9189491 | Fushman et al. | Nov 2015 | B2 |
9201644 | Klein et al. | Dec 2015 | B2 |
9203841 | Neuman et al. | Dec 2015 | B2 |
9223961 | Sokolov | Dec 2015 | B1 |
9225840 | Malatack et al. | Dec 2015 | B2 |
9253185 | Alaranta et al. | Feb 2016 | B2 |
9258296 | Juthani | Feb 2016 | B2 |
9282085 | Oberheide et al. | Mar 2016 | B2 |
9338156 | Oberheide et al. | May 2016 | B2 |
9338163 | Wendling et al. | May 2016 | B2 |
9386003 | Kumar | Jul 2016 | B2 |
9391980 | Krahn et al. | Jul 2016 | B1 |
9430938 | Proud | Aug 2016 | B2 |
9443084 | Nice et al. | Sep 2016 | B2 |
9479509 | Zeuthen | Oct 2016 | B2 |
9659160 | Ligatti et al. | May 2017 | B2 |
9668137 | Sigurdson et al. | May 2017 | B2 |
9706410 | Sreenivas et al. | Jul 2017 | B2 |
20020013898 | Sudia et al. | Jan 2002 | A1 |
20020136410 | Hanna | Sep 2002 | A1 |
20030061506 | Cooper et al. | Mar 2003 | A1 |
20030115452 | Sandhu et al. | Jun 2003 | A1 |
20040139312 | Medvinsky | Jul 2004 | A1 |
20060031938 | Choi | Feb 2006 | A1 |
20060059569 | Dasgupta et al. | Mar 2006 | A1 |
20070250914 | Fazal et al. | Oct 2007 | A1 |
20070284429 | Beeman | Dec 2007 | A1 |
20070297607 | Ogura et al. | Dec 2007 | A1 |
20080120411 | Eberle | May 2008 | A1 |
20080229104 | Ju et al. | Sep 2008 | A1 |
20090055906 | Von Wendorff | Feb 2009 | A1 |
20090167489 | Nan et al. | Jul 2009 | A1 |
20090271863 | Govindavajhala et al. | Oct 2009 | A1 |
20100023781 | Nakamoto | Jan 2010 | A1 |
20100042954 | Rosenblatt et al. | Feb 2010 | A1 |
20100180001 | Hardt | Jul 2010 | A1 |
20100274859 | Bucuk | Oct 2010 | A1 |
20110026716 | Tang et al. | Feb 2011 | A1 |
20110138469 | Ye et al. | Jun 2011 | A1 |
20110197267 | Gravel et al. | Aug 2011 | A1 |
20110219449 | St Neitzel et al. | Sep 2011 | A1 |
20110302410 | Clarke et al. | Dec 2011 | A1 |
20120096274 | Campagna et al. | Apr 2012 | A1 |
20120227098 | Obasanjo et al. | Sep 2012 | A1 |
20130060708 | Oskolkov et al. | Mar 2013 | A1 |
20130110676 | Kobres | May 2013 | A1 |
20130125226 | Shah et al. | May 2013 | A1 |
20130239168 | Sreenivas et al. | Sep 2013 | A1 |
20130246281 | Yamada et al. | Sep 2013 | A1 |
20140177842 | Yellepeddy et al. | Jun 2014 | A1 |
20140201841 | Deshpande et al. | Jul 2014 | A1 |
20140208405 | Hashai | Jul 2014 | A1 |
20140244993 | Chew | Aug 2014 | A1 |
20140245278 | Zellen | Aug 2014 | A1 |
20140351954 | Brownell et al. | Nov 2014 | A1 |
20150242643 | Hankins, Jr. | Aug 2015 | A1 |
20160056962 | Mehtälä | Feb 2016 | A1 |
20160164866 | Oberheide et al. | Jun 2016 | A1 |
20160286391 | Khan | Sep 2016 | A1 |
Number | Date | Country |
---|---|---|
2639997 | Sep 2013 | EP |
Entry |
---|
Edge, Kenneth, et al. “The use of attack and protection trees to analyze security for an online banking system.” System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on. IEEE, 2007. |
Goldfeder et al., Securing Bitcoin wallets via a new DSA/ECDSA threshold signature scheme, http://www.cs.princeton.edu/˜stevenag/threshold_sigs.pdf, 2015. |
Neuenhofen, Kay, and Mathew Thompson. “A secure marketplace for mobile java agents.” Proceeding of the second international Conference on Autonomous agents. ACM, 1998. (pp. 212-218). |
Simske et al., “APEX: Automated Policy Enforcement eXchange”, Sep. 21-24, 2010, ACM, pp. 139-142. |
Symantec, Administration guide for symantec Endpoint protection and symantec network access control, 2009, version 11.00.05.00.00. |
Symantec, Administration Guide for Symantec TM Endpoint Protection and Symantec Network Access Control, Aug. 1, 2007. |
Number | Date | Country | |
---|---|---|---|
20180007025 A1 | Jan 2018 | US |
Number | Date | Country | |
---|---|---|---|
62197316 | Jul 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15193533 | Jun 2016 | US |
Child | 15685626 | US |