Change search
ReferencesLink to record
Permanent link

Direct link
Regular SPKI
Number of Authors: 1
2003 (English)Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2003, 1.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22401OAI: oai:DiVA.org:ri-22401DiVA: diva2:1041946
Conference
Cambridge Security Protocols, 11th International Workshop
Note
Revised Selected Papers. Lecture Notes in Computer Science 3364 Springer 2005. ISBN 3-540-28389-7Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(151 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 151 kBChecksum SHA-512
d63f30d532d6d2f7941f9caaae4694439e0383eba67a99e16e5514ed6ac357d10e00c3bdcf58eaf9d136175d87bd5bfc16e25e2de77ba5f5ca86d8604718d9ab
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 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: 3 hits
ReferencesLink to record
Permanent link

Direct link