2015
DOI: 10.1007/s10489-015-0692-8
|View full text |Cite
|
Sign up to set email alerts
|

A temporal defeasible logic for handling access control policies

Abstract: Access control policies are specified within systems to ensure confidentiality of their information. Available knowledge about policies is usually incomplete and uncertain. An essential goal in reasoning is to reach conclusions which can be justified. However, since justification does not necessarily guarantee truth, the best we can do is to derive "plausible/ tentative" conclusions from partial and conflicting information. Policies are typically expressed as rules that could be complex and include timing cons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…Constraint logic programming is used by (Barker & Stuckey 2007) to represent an extension to the RBAC model which allows defining access policies that may include features, like denials of access and temporal authorizations. Furthermore, (Sabri & Obeid 2016) develop a theory based on defeasible logic to handle conflicting policies. However, this language is not used for specifying and enforcing constraints.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…Constraint logic programming is used by (Barker & Stuckey 2007) to represent an extension to the RBAC model which allows defining access policies that may include features, like denials of access and temporal authorizations. Furthermore, (Sabri & Obeid 2016) develop a theory based on defeasible logic to handle conflicting policies. However, this language is not used for specifying and enforcing constraints.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…The framework is used to generate preference sets for users, which is a set of active rules for each user. Defeasible Logic DL [16] [22] had approved to be one of the famous logic tools that are successful to characterize contextual reasoning; it has a nonmonotonic relation between the premises and their consequences which is an effective way of formalizing the dynamic nature of ubiquities computing. Several studies succeeded to build models that could reason in the shade of contextual information based on DL [19] [33] [34].…”
Section: Related Studiesmentioning
confidence: 99%
“…Let P(1..i) denote the initial part of the sequence P n of length i where i ≤ n. Then a conclusion, proved subsequently [16], could be either:…”
Section: A Concern Level Proofmentioning
confidence: 99%
“…There have been several other attempts to enable agents to reason over various kinds of policies. However, these involve reasoning over access control policies only [7,17,1] and a few utilize ASP as a reasoning tool for this purpose [3,4]. Access control policies are more restrictive than the kinds of policies an agent using AOPL can reason over.…”
Section: Introductionmentioning
confidence: 99%