A note on SPKI's authorisation syntax
Number of Authors: 2
2002 (English)Conference paper (Refereed)
Tuple reduction is the basic mechanism used in SPKI to make authorisation decisions. A basic problem with the SPKI authorisation syntax is that straightforward implementations of tuple reduction are quadratic in both time and space. In the paper we introduce a restricted version of the SPKI authorisation syntax, which appears to conform well with practice, and for which authorisation decisions can be made in nearly linear time.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14692OAI: oai:DiVA.org:ri-14692DiVA: diva2:1035986
Proceedings of 1st International PKI Research Workshop