Linked authenticated dictionaries for certificate status verification
There’s presented a proposal of a new certificate revocation scheme using linked authenticated dictionaries in the note. It was mainly basis of idea of Certificate Revocation Trees linking, but it’s more generall. This scheme prevents Certification Authority doing some possible frauds. This way the neccessery trust level to CA is decreased.
Key wordscertificate revocation authenticated dictinary dictionaries linking
Unable to display preview. Download preview PDF.
- Paul Kocher. A Quick Introduction to Certificate Revocation Trees(CRTs). Technical report, ValiCert, 1999.Google Scholar
- Michael T. Goodrich, Roberto Tamassia. Efficient Authenticated Dictionaries with Skip Lists and Commutative Hashing. Technical Report, Johns Hopkins Information Security Institute, 2000.Google Scholar
- Moni Naor, Kobbi Nissim. Certificate Revocation and Certificate Update. Proceedings 7th USEMX Security Symposium (San Antonio, Texas), 1998Google Scholar
- Chip Martel, Glen Nuckolls, Prem Devanbu, Michael Gertz, April Kwong, Stuart G. Stubblebine. A General Model for Authenticated Data Structures. Technical Report CSE-2001-9, 2001Google Scholar
- Wlodzimierz Chocianowicz, Witold Maćków, Jerzy Pejaś. Protocols of revocation and status verification methods for public key certificates., RSA Conference, Paris. 2002Google Scholar
- Silvio Micali. Efficient Certificate Revocation. Technical report, Massachusetts Institute of Technology, 1996Google Scholar
- Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson. Time-Stamping with Binary Linking Schemes. Advances on Cryptology — CRYPTO ′98. 1998Google Scholar