Regular SPKI

Authors:
Mads Dam
Affiliations:
LECS/IMIT, Royal Institute of Technology (KTH), Kista, Sweden
Venue:
Proceedings of the 11th international conference on Security Protocols
Year:
2003

Citing 3
Cited 0

Certificate chain discovery in SPKI?SDSI

Journal of Computer Security
Analysis of SPKI/SDSI Certificates Using Model Checking

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Constrained Delegation

SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

SPKI is a certificate-based framework for authorisation in distributed systems. The SPKI framework is extended by an iteration construct, essentially Kleene star, to express constraints on delegation chains. Other possible applications, not explored in the paper, include multidomain network routing path constraints. The main decision problems for the extended language are shown to correspond to regular language membership and containment respectively. To support an efficient decision algorithm in both cases we give a sound and complete inference system for a fragment of the language which is decidable in polynomial time. We finally show how to use the extended syntax to represent constrained delegation in SPKI.