Revocation of cryptographic digital certificates

• US 8,024,562 B2
• Filed: 06/26/2009
• Issued: 09/20/2011
• Est. Priority Date: 08/31/2004
• Status: Active Grant

• Current Assignee: NTT Docomo Incorporated (Nippon Telegraph and Telephone Corporation)
• Original Assignee: NTT Docomo Incorporated (Nippon Telegraph and Telephone Corporation)
• Inventors: Gentry, Craig B., Ramzan, Zulfikar Amin, Bruhn, Bernhard
• Primary Examiner(s): Barron, Jr.; Gilberto
• Assistant Examiner(s): HO, VIRGINIA T
• Application Number:
  US12/492,901
• Publication Number:
  US 20090287924A1
• Time in Patent Office: 816 Days
• Field of Search: 713156-158, 713/175
• US Class Current: 713/158
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 2209/80 Wireless network architectures or network communication protocols for wireless network security H04W12/00
• CPC Class Codes: H04L 63/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 9/3236 using cryptographic hash functions
• CPC Class Codes: H04L 9/3265 using certificate chains, trees or paths; Hierarchical trust model
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

In the setup phase, the certification authority (CA 120) generates validation proof data structures for greater time than the maximum validity period of any digital certificate. Therefore, new certificates can be added to the existing data structures after the setup phase.

Claims

1. A method for generating computer-readable computer data for a plurality of slots of digital certificates, the computer data being for generating validity or invalidity proofs for the digital certificates, wherein each slot is associated with at most one digital certificate, and each digital certificate is associated with a respective one of the slots;

wherein each digital certificate certifies that a cryptographic key is associated with an entity, and each digital certificate is associated with an expiration time indicating when the certificate expires, each digital certificate comprising revocation data for enabling revocation of the digital certificate before the certificate'"'"'s expiration time;

the method comprising;

generating, in a data carrier;

one or more digital certificates, wherein the number of slots is greater than the number of the one or more digital certificates; and

first computer data for generating proofs of validity or invalidity for any digital certificate associated with a slot;

wherein the computer data comprises the one or more digital certificates and the first computer data;

wherein a plurality of sets F is defined, each set F being a set of one or more of the slots, each slot belonging to at least one set F;

wherein each proof is digital data associated with a set F and with time, and is for proving validity or invalidity, at the associated time, for each digital certificate associated with a slot in the set F, wherein the proof depends on secret data associated with the set F;

wherein said generating of the one or more digital certificates and the first computer data comprises;

generating, for at least each set F comprising at least one slot associated with a digital certificate, the secret data associated with the set F, the first computer data comprising the secret data;

for at least each slot associated with a digital certificate, generating the digital certificate'"'"'s revocation data from the secret data;

wherein for each digital certificate, the certificate'"'"'s validity or invalidity status for a given time is verifiable, even before the certificate'"'"'s expiration time, by a verification method comprising;

obtaining the proof associated with the given time and with a set F comprising a slot associated with the digital certificate; and

performing a predefined verification operation on the proof and the digital certificate'"'"'s revocation data;

wherein the time associated with at least one proof is operable to extend beyond the expiration time of each of the one or more digital certificates, to permit subsequent creation of one or more additional digital certificates and association of each additional digital certificate with an empty slot (a slot not previously associated with any digital certificate), and to permit at least one additional digital certificate to be associated with an expiration time which is later than the expiration time of each of said one or more digital certificates.

2. The method of claim 1 further comprising creating an additional certificate having an expiration time which is later than the expiration time of each of said one or more digital certificates, and associating the additional certificate with an empty slot.

3. A computer system adapted to perform the method of claim 2.

4. A non-transitory data carrier comprising one or more computer instructions operable to cause a computer system to perform the method of claim 2.

5. The method of claim 1 wherein said generating of the one or more digital certificates and the first computer data comprises generating, for each set F, the secret data associated with the set F.

6. A non-transitory data carrier comprising one or more computer instructions operable to cause a computer system to perform the method of claim 5.

7. The method of claim 1 wherein at least one of the one or more certificates is associated with a slot belonging to multiple sets F, and the revocation data for said at least one of the one or more certificates depends on the secret data associated with each of said multiple sets F.

8. A computer system adapted to perform the method of claim 7.

9. A non-transitory data carrier comprising one or more computer instructions operable to cause a computer system to perform the method of claim 7.

10. The method of claim 1 wherein the revocation data associated with each digital certificate depends on the secret data associated with each set F containing a slot associated with the digital certificate;

wherein at least one set F has more than one slots.

11. The method of claim 10 wherein the sets F form a complement cover for a set of all the slots.

12. A computer system adapted to perform the method of claim 10.

13. A non-transitory data carrier comprising one or more computer instructions operable to cause a computer system to perform the method of claim 10.

14. The method of claim 1 wherein at least two different sets F have respective different numbers of slots, and each proof has a bit length independent of the number of the slots in the set F with which the proof is associated.

15. The method of claim 1 wherein the secret data associated with each set F is randomly generated separately from the secret data associated with every other set F.

16. A computer system adapted to perform the method of claim 1.

17. A non-transitory data carrier comprising one or more computer instructions operable to cause a computer system to perform the method of claim 1.