Key Revocation with Interval Cover Families

  • Johannes Blömer
  • Alexander May
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2259)


We present data structures for complement covering with intervals and their application for digital identity revocation. We give lower bounds showing the structures to be nearly optimal. Our method improves upon the schemes proposed by S. Micali [5],[6] and Aiello, Lodha, Ostrovsky [1] by reducing the communication between a Certificate Authority and public directories while keeping the number of tokens per user in the public key certificate small.


Range Query Interval Tree Digital Identity Sibling Node Revocation Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    W. Aiello, S. Lodha, R. Ostrovsky, “Fast Digital Identity Revocation”, Proc. Crypto’ 98, Lecture Notes in Computer Science Vol. 1462, pages 137–152, 1998Google Scholar
  2. 2.
    S. Even, O. Goldreich, S. Micali, “On-line/Off-line Digital Signing”, Proc. Crypto’ 89, Lecture Notes in Computer Science Vol. 435, pages 263–275, 1989CrossRefGoogle Scholar
  3. 3.
    P. Kocher, “A quick introduction to Certificate Revocation Trees”, unpublished manuscript, 1998Google Scholar
  4. 4.
    L. Lamport, “Password authentication with insecure communication”, Communications of ACM, 24, pages 770–771, 1981CrossRefGoogle Scholar
  5. 5.
    S. Micali, “Enhanced Certificate Revocation System”, Technical memo MIT/LCS/TM-542,, 1995
  6. 6.
    S. Micali, “Certificate Revocation System”, U.S. Patent number 5666416, 1997Google Scholar
  7. 7.
    M. Naor and K. Nissim, “Certificate Revocation and Certificate Update”, Proceedings of 7th USENIX Security Symposium, pages 217–228, 1998Google Scholar
  8. 8.
    Andrew C. Yao, “Space-time trade-off for answering range queries (extended abstract)”, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 128–136, 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Johannes Blömer
    • 1
  • Alexander May
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations