Abstract
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.
Chapter PDF
References
W. Aiello, S. Lodha, R. Ostrovsky, “Fast Digital Identity Revocation”, Proc. Crypto’ 98, Lecture Notes in Computer Science Vol. 1462, pages 137–152, 1998
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, 1989
P. Kocher, “A quick introduction to Certificate Revocation Trees”, unpublished manuscript, 1998
L. Lamport, “Password authentication with insecure communication”, Communications of ACM, 24, pages 770–771, 1981
S. Micali, “Enhanced Certificate Revocation System”, Technical memo MIT/LCS/TM-542, ftp://ftp-pubs.lcs.mit.edu/pub/lcs-pubs/tm.outbox, 1995
S. Micali, “Certificate Revocation System”, U.S. Patent number 5666416, 1997
M. Naor and K. Nissim, “Certificate Revocation and Certificate Update”, Proceedings of 7th USENIX Security Symposium, pages 217–228, 1998
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, 1982
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blömer, J., May, A. (2001). Key Revocation with Interval Cover Families. In: Vaudenay, S., Youssef, A.M. (eds) Selected Areas in Cryptography. SAC 2001. Lecture Notes in Computer Science, vol 2259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45537-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-45537-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43066-7
Online ISBN: 978-3-540-45537-0
eBook Packages: Springer Book Archive