Abstract:
The practical benefit of the inventive idea results from an assumption that typically, the operational subCAs will not get compromised. Assuming this, a a batch of revocation lists manifesting no revocations can be generated and signed. These pregenerated CRLs (root CRLs) can then be stored outside the high-security vault and, in case of no subCA compromises, published periodically one at a time to the directory system where the PKI clients can automatically fetch them.

Description:
BACKGROUND OF THE INVENTION  
         [0001]    1. Field of the Invention  
           [0002]    The invention relates to methods for management of certificates in a public key infrastructure. Especially, the invention is related to such a method as specified in the preamble of the independent method claim.  
           [0003]    2. Description of Related Art  
           [0004]    Public-key infrastructure (PKI) provides means for reliably and securely performing authentication, ensuring message integrity, and providing non-repudiation of transactions in an online environment. PKI is based on the use of public-key (asymmetric) cryptography. In asymmetric cryptography the encryption and decryption of messages is done with different keys. This means that each participating entity (person or device) of the PKI has a set of two keys, a public key and a private key.  
           [0005]    Private keys are secret and known only to their owners. Private keys are used for signing and decrypting messages. A common way to ensure the safety of a private key is to store it on a separate piece of hardware (a security token such as a smart card).  
           [0006]    Public keys are, as the name implies, public and can be published, for example, in a public directory or on a Web server. Public keys are used for validating signatures and encrypting messages. The two keys are mathematically dependent but the private key cannot be derived from the public key. Furthermore, the two keys possess a distinct quality: what the public key encrypts can only be decrypted by the private key.  
           [0007]    Before public-key operations can be made, the public key has to be received securely, so that no one can substitute the genuine key with a tampered one. Certificates can be used for distributing public keys of end entities.  
           [0008]    Certificates are digital documents that are used for secure authentication of communicating parties. Certificates are also used for sending the public keys of entities to other entities. A certificate binds identity information about an entity to the entity&#39;s public key for a certain validity period. The digital signature of a trusted party makes certificates verifiable with the public key of the trusted party. Certificates can be thought of as analogous to passports that guarantee the identity of their bearers.  
           [0009]    To enable wide usage of certificates and interoperable implementations from multiple vendors, certificates have to be based on standards. The most advanced and widespread certificate specifications at the moment are defined by the PKIX Working Group of the IETF (the Internet Engineering Task Force).  
           [0010]    End entities are individual users or devices that transact with each other. End entities do not necessarily know each other and they need a way of finding out whether the other party of a transaction is trustworthy.  
           [0011]    To enroll in a public-key infrastructure, an end entity needs to request certification for its public key from a certification authority (CA). Certification authorities are entities that vouch for the identity and trustworthiness of the certified end entities. The CA is a trusted third party that the end entities know to be trustworthy. By issuing certificates to the identified end entities, the CA indicates that it vouches for them. Certification authorities can be thought of as being analogous to governments issuing passports for their citizens. A valid certificate signed by a valid CA proves that an end entity is who or what she claims to be.  
           [0012]    A certification authority can be operated by an external certification service provider, or even by a government, or the CA can belong to the same organization as the end entities. CAs can also issue certificates to other (sub) CAs. This leads to a tree-like certification hierarchy. The top CA in the tree is called a root CA. FIG. 1 shows a sample certification hierarchy. FIG. 1 shows a root CA  10 , sub-CAs  20  directly certified by the root CA, sub-CAs  30  certified by one sub-CA  20 , and end entities  40 .  
           [0013]    In some cases, a CA can delegate the actual identification of end entities as well as some other administrative tasks to a separate entity, the registration authority (RA). The RA performs the identification of the end entities and then signs the end-entity certification requests with its RA private key.  
           [0014]    Because the CA has delegated the task of end-entity identification to the RA, the RA signature in the request gives the CA a guarantee of the right for end-entity certification. This allows the CA to operate automatically in online interaction while the local RAs perform the required out-of-band interaction with end entities.  
           [0015]    Using local RAs a large geographically or operationally distributed PKI can work in a scalable way, even when the actual certificate issuing is centralized.  
           [0016]    Certificate enrollment is an action in which a CA certifies a public key. The actual enrollment process consists of the following steps:  
           [0017]    1. Generating a key pair.  
           [0018]    2. End entity requesting certification for the public key.  
           [0019]    3. CA or RA verifying the identity of the end entity.  
           [0020]    4. CA generating a certificate for the end entity and making it available (if the request is approved).  
           [0021]    End entities can use standard request formats for requesting certificates from a CA. The CA uses the underlying certificate policy to decide whether to approve the request or not. The policy decision and the approval/denial can be automatic, or the operator of the CA may have to approve the requests manually. If identification of the end entity is needed, the RA may perform this function. If the request is approved, a signed certificate will be issued and delivered to the end entity and possibly also published to a public directory.  
           [0022]    Certificate Revocation  
           [0023]    Certificates have pre-defined lifetimes, typically lasting from a couple of weeks to several years. If a private key of an end entity is compromised or the right to authenticate with a certificate is lost during the certificate&#39;s validity period, the certificate has to be revoked, and all PKI users have to be informed about this in some way. Certificate revocation lists are used for this purpose.  
           [0024]    A certificate revocation list (CRL) is a list identifying the revoked certificates and it is signed by a CA. Each CA publishes CRLs on a regular basis. The publishing interval may vary from a couple of minutes to several hours, depending on the security policy of the CA. Verification of a certificate has to include the retrieval of the latest CRL to check that the certificate has not been revoked.  
           [0025]    As the certificate revocation lists are updated on a periodic basis, they do not provide real-time status information. If more strict security is required, online certificate status services can be used. In Online Certificate Status Protocol (OCSP) a dedicated OCSP responder entity responds to status requests made by end entities. This kind of function is required for example in a PKI where high-value business transactions are digitally signed.  
           [0026]    Certificates and CRLs need to be publicly available for the end entities that perform validation and encryption. A typical solution for publishing certificates is to use an LDAP directory or a Web server as a PKI repository. The Lightweight Directory Access Protocol (LDAP) has become the de facto standard procedure for CRL and certificate distribution.  
           [0027]    In typical PKI hierarchies, the main function of the root CA is to certify a number of sub-CAs, which take care of the actual day-to-day work of the PKI. For security reasons, the root CA is often offline, possibly secured in a physically secured area, for example in a bank vault. Such an arrangement minimizes the security risks of the PKI hierarchy. In a large scale PKI the worst-case event in the threat model is the leakage of the root CA private key to an attacker: this would allow the attacker to perform any actions with the authority of the whole PKI hierarchy. Any other key compromise can be compensated for effortlessly and reliably within some predefined time window with the Certificate Revocation List mechanism. Recovering from the root key compromise requires updating the trust anchor at each and every piece of equipment which are part of the PKI, and this task cannot be performed with remote access in a secure manner, so this recovery process is very labor extensive, error-prone and expensive.  
           [0028]    Having the root CA offline in a physically secure location prevents the leakage of the root secret key from happening. However, the root CA must anyway produce certificate revocation lists, which in the typical case merely indicate that the certificates of the sub-CAs are still valid. Production of such certificate revocation lists is a chore due to the high security measures: an operator needs to go in person to the root CA computer and manufacture the CRL.  
         SUMMARY OF THE INVENTION  
         [0029]    An object of the invention is to realize a easier method of operating a PKI hierarchy. A further object of the invention is to reduce the practical work needed to produce and distribute of certificate revocation lists from the root CA.  
           [0030]    The objects are reached by arranging the root CA to produce a plurality of certificate revocation lists in advance, the validity period of these certificate revocation lists forming a sequence, and issuing one of these pregenerated certificate revocation lists at a time if no security breaches of the concerned sub-CAs have been observed.  
           [0031]    The method according to the invention is characterized by that, which is specified in the characterizing part of the independent method claim. The system according to the invention is characterized by that, which is specified in the characterizing part of the independent claim directed to a system. The computer program product according to the invention is characterized by that, which is specified in the characterizing part of the independent claim directed to a computer program product. The dependent claims describe further advantageous embodiments of the invention.  
           [0032]    The practical benefit of the inventive idea results from an assumption that typically, the operational subCAs will not get compromised. Assuming this, a a batch of revocation lists manifesting no revocations can be generated and signed. These pregenerated CRLs (root CRLs) can then be stored outside the high-security vault and, in case of no subCA compromises, published periodically one at a time to the directory system where the PKI clients can automatically fetch them.  
           [0033]    The inventive idea is strongly against the prejudice of the field, since certification revocation lists are meant to describe the current status of affected certificates. Pregenerating certificate revocation lists for later use goes directly against this conception.  
           [0034]    The inventive approach offers a high level of flexibility in trade-offs between security, ie. the difficulty for the attacker to obtain these CRLs, and convenience, ie. the amount of human intervention required for the periodic CRL updates to get published in the LDAP directory.  
           [0035]    If maximal convenience is wished for, the CRLs can be stored on an on-line CA system in plaintext or encrypted with a secret which is stored in the system RAM at runtime. The root CRLs can therefore be automatically published without regular operator intervention.  
           [0036]    If moderate convenience and a somewhat higher level of security is desired, the root CRLs can be stored on an on-line CA system encrypted with a secret which must be input by a human operator (potentially remotely via a trusted communication channel). The root CRLs get therefore published with minimal regular operator intervention, i.e., requiring only the input of the secret.  
           [0037]    In a further advantageous embodiment of the invention, a sequence of CRLs is generated for each concerned sub-CA by the root CA for possible later use, each CRL in a particular sequence indicating the revocation of the particular sub-CA. In case of an actual security breach, one of these CRLs revoking the particular breached sub-CA can then be immediately published.  
           [0038]    In a still further advantageous embodiment, the root CA is arranged to generate one sequence or batch pregenerate even one batch of root CRLs for each possible combination of revoked subCAs. Naturally, this embodiment of the invention is most advantageus in such cases, where the number of sub-CAs is small.  
           [0039]    In a further advantageous embodiment of the invention, the root CA is arranged to generate and sign another batch of revocation lists which temporarily suspend (revoke revocation reason “certificateHold” which basically means reversible revocation) all the subCAs. These CRLs would get published in case of a hostile subCA compromise when it is crucial to minimize the time window where attacker can exploit the compromised key.  
           [0040]    Temporary suspension is advantageous, since revoking the certificate of a CA causes a large amount of work: all certificates issued by the CA must be reissued to end entities. Temporary suspension allows the operators to publish a CRL at the first sign of a possible breach in the security of a sub-CA, investigate the situation, and publish a real revocation only after a real breach has been positively detected and the affected sub-CA identified. In effect, temporary suspension allows the operators to react to a mere possibility of breach, without having to judge the inconvenient consequences of a false alarm. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0041]    Various embodiments of the invention will be described in detail below, by way of example only, with reference to the accompanying drawings, of which  
         [0042]    [0042]FIG. 1 illustrates a certificate authority hierarchy according to prior art. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0043]    The exemplary embodiments of the invention presented in this description are not to be interpreted to pose limitations to the applicability of the appended claims. The verb “to comprise” is used as an open limitation that does not exclude the existence of also unrecited features. The features recited in depending claims are mutually freely combinable unless otherwise explicitly stated.  
         [0044]    According to a first aspect of the invention a method for managing certificates in a certificate authority in a system having at least a first plurality of certificate authorities is provided. According to an advantageous embodiment of the invention the method comprises the step of generating at least two certificate revocation lists of a first type, each of said at least two certificate revocation lists of a first type not indicating a revoked status of any certificate authority in said at least a first plurality of certificate authorities, said at least two certificate revocation lists of a first type having at least partially consecutive validity periods, where the beginning of the validity period of at least one of said at least two certificate revocation lists of a first type is a future point of time, publishing said certificate revocation lists of a first type one at a dine, each essentially at the time of the beginning of the validity period of that particular certificate revocation list.  
         [0045]    According to a further advantageous embodiment of the invention, the method further comprises the steps of checking regarding each of certificate authorities listed in said certification revocation lists of a first type if the security of each of certificate authorities has been breached or not; and if the security of none of said certificate authorities has been breached, publishing one of said certificate revocation lists of a first type.  
         [0046]    According to a further advantageous embodiment of the invention, the method further comprises the steps of generating at least two certificate revocation lists of a second type, each of said at least two certificate revocation lists of a second type indicating a revoked status of at least one certificate authority in said at least a first plurality of certificate authorities,  
         [0047]    said at least two certificate revocation lists of a second type having at least partially consecutive validity periods, where the beginning of the validity period of at least one of said at least two certificate revocation lists of a second type is a future point of time.  
         [0048]    According to a further advantageous embodiment of the invention, the method further comprises the steps of checking regarding each of certificate authorities in said at least a first plurality of certificate authorities if the security of each of certificate authorities has been breached or not; and if the security of none of said certificate authorities has been breached, publishing one of said certificate revocation lists of a first type, and if the security of at least one of said certificate authorities has been breached, publishing one of said certificate revocation lists of a second type.  
         [0049]    According to a further advantageous embodiment of the invention, the method further comprises the steps of generating for each certificate authority in said at least a first plurality of certificate authorities if the security of each of certificate a series of certificate revocation lists which indicate a revoked status of said certificate authority.  
         [0050]    According to a further advantageous embodiment of the invention, the method further comprises the steps of generating at least two certificate revocation lists of a third type, each of said at least two certificate revocation lists of a third type indicating a temporarily suspended status of at least one certificate authority in said at least a first plurality of certificate authorities, said at least two certificate revocation lists of a third type having at least partially consecutive validity periods, where the beginning of the validity period of at least one of said at least two certificate revocation lists of a third type is a future point of time.  
         [0051]    According to a second aspect of the invention, a system for a certificate authority having means for generating certificate revocation lists is provided. According to an advantageous embodiment of the invention, the system comprises means for generating sequences of certificate revocation lists of a first type having at least partially consecutive validity periods, the beginning of the validity period of at least one of said revocation lists of a first type being a future point of time relative to the time of generating a sequence of certificate revocation lists, said certificate revocation lists of a first type indicating no revocation for a predefined group of certificate authorities.  
         [0052]    According to a further advantageous embodiment of the invention, the system further comprises means for publishing said certificate revocation lists of a first type one at a time, each essentially at the time of the beginning of the validity period of that particular certificate revocation list.  
         [0053]    According to a further advantageous embodiment of the invention, the system further comprises means for generating sequences of certificate revocation lists of a second type having at least partially consecutive validity periods, the beginning of the validity period of at least one of said revocation lists of a second type being a future point of time relative to the time of generating a sequence of certificate revocation lists, and means for generating an indication of a revoked status of at least one certificate authority in said predefined group of certificate authorities in each certificate revocation list generated by said means for generating sequences of certificate revocation lists of a second type.  
         [0054]    According to a further advantageous embodiment of the invention, the system further comprises means for checking regarding each of certificate authorities in said predefined group of certificate authorities if the security of each of said certificate authorities has been breached or not; means for publishing one of said certificate revocation lists of a first type if the security of none of said certificate authorities has been breached, and means for publishing one of said certificate revocation lists of a second type if the security of at least one of said certificate authorities has been breached.  
         [0055]    According to a third aspect of the invention, a computer program product for a certificate authority having computer code means for generating certificate revocation lists is provided. According to an advantageous embodiment of the invention, the computer program product comprises means for generating sequences of certificate revocation lists of a first type having at least partially consecutive validity periods, the beginning of the validity period of at least one of said revocation lists of a first type being a future point of time relative to the time of generating a sequence of certificate revocation lists, said certificate revocation lists of a first type indicating no revocation for a predefined group of certificate authorities.  
         [0056]    According to an advantageous embodiment of the invention, the computer program product comprises computer code means for publishing said certificate revocation lists of a first type one at a time, each essentially at the time of the beginning of the validity period of that particular certificate revocation list.  
         [0057]    According to an advantageous embodiment of the invention, the computer program product comprises computer code means for generating sequences of certificate revocation lists of a second type having at least partially consecutive validity periods, the beginning of the validity period of at least one of said revocation lists of a second type being a future point of time relative to the time of generating a sequence of certificate revocation lists, and computer code means for generating an indication of a revoked status of at least one certificate authority in said predefined group of certificate authorities in each certificate revocation list generated by said means for generating sequences of certificate revocation lists of a second type.  
         [0058]    According to an advantageous embodiment of the invention, the computer program product comprises computer code means for checking regarding each of certificate authorities in said predefined group of certificate authorities if the security of each of said certificate authorities has been breached or not; computer code means for publishing one of said certificate revocation lists of a first type if the security of none of said certificate authorities has been breached, and computer code means for publishing one of said certificate revocation lists of a second type if the security of at least one of said certificate authorities has been breached.  
         [0059]    The computer program product can be implemented in many different ways. For example, the computer program product can be implemented as an application program executed in a computer device or as an application program stored on a computer readable media such as a hard disk, a CD-ROM, an electronic memory module, or on on other media. The computer program product can also be implemented as a subroutine library for inclusion in other programs.  
         [0060]    The invention has been described using some particular advantageous embodiments as examples. However, various implementations of the invention are not limited to the described examples, and the invention can be realized in many different ways within the scope of the attached patent claims.