liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Understanding Certificate Revocation
Linköping University, Department of Electrical Engineering. Linköping University, The Institute of Technology.
2006 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Correct certificate revocation practices are essential to each public-key infrastructure. While there exist a number of protocols to achieve revocation in PKI systems, there has been very little work on the theory behind it: Which different types of revocation can be identified? What is the intended effect of a specific revocation type to the knowledge base of each entity?

As a first step towards a methodology for the development of reliable models, we present a graph-based formalism for specification and reasoning about the distribution and revocation of public keys and certificates. The model is an abstract generalization of existing PKIs and distributed in nature; each entity can issue certificates for public keys that they have confidence in, and distribute or revoke these to and from other entities.

Each entity has its own public-key base and can derive new knowledge by combining this knowledge with certificates signed with known keys. Each statement that is deduced or quoted within the system derives its support from original knowledge formed outside the system. When such original knowledge is removed, all statements that depended upon it are removed as well. Cyclic support is avoided through the use of support sets.

We define different revocation reasons and show how they can be modelled as specific actions. Revocation by removal, by inactivation, and by negation are all included. By policy, negative statements are the strongest, and positive are the weakest. Collisions are avoided by removing the weaker statement and, when necessary, its support.

Graph transformation rules are the chosen formalism. Rules are either interactive changes that can be applied by entities, or automatically applied deductions that keep the system sound and complete after the application of an interactive rule.

We show that the proposed model is sound and complete with respect to our definition of a valid state.

Place, publisher, year, edition, pages
Institutionen för systemteknik , 2006. , 135 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1216
Keyword [en]
Revocation, Public-key certificates, Graph transformation
National Category
Other Computer and Information Science
URN: urn:nbn:se:liu:diva-5477ISBN: 91-85457-84-1OAI: diva2:21328
2006-02-17, Key 1, Keyhuset, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Report code: LIU-TEK-LIC-2006:1Available from: 2006-02-03 Created: 2006-02-03 Last updated: 2009-02-24

Open Access in DiVA

fulltext(564 kB)1020 downloads
File information
File name FULLTEXT01.pdfFile size 564 kBChecksum MD5
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Hagström, Åsa
By organisation
Department of Electrical EngineeringThe Institute of Technology
Other Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1020 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 498 hits
ReferencesLink to record
Permanent link

Direct link