Show simple item record

AuthorHu, Jinwei
AuthorKhan, Khaled M.
AuthorBai, Yun
AuthorZhang, Yan
Available date2024-04-02T06:04:50Z
Publication Date2012
Publication NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
AbstractWe propose an approach to placing usage-constraints on RT credentials; issuers specify constraints by designing non-deterministic finite automata. We show by examples that this approach can express constraints of practical interest. We present a compliance checker in the presence of usage-constraints, especially for trust negotiation systems. Given an RT policy, the checker is able to find all minimal satisfying sets, each of which uses credentials in a way consistent with given constraints. The checker leverages answer set programming, a declarative logic programming paradigm, to model and solve the problem. We also show preliminary experimental results: supporting usage-constraints on credentials incurs affordable overheads and the checker responds efficiently.
PublisherSpringer Berlin Heidelberg
SubjectAnswer set programming
Compliance checking
Declarative logic
Nondeterministic finite automaton
Programming paradigms
Trust negotiations
Automata theory
Logic programming
Security of data
Model checking
TitleCompliance checking for usage-constrained credentials in trust negotiation systems
TypeConference Paper
Volume Number7483 LNCS

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record