Time dependent policy-based access control

Panagiotis Vasilikos; Flemming Nielson; Hanne Riis Nielson

doi:10.4230/LIPIcs.TIME.2017.21

Time dependent policy-based access control

Panagiotis Vasilikos
, Flemming Nielson
, Hanne Riis Nielson

Department of Applied Mathematics and Computer Science

Research output: Contribution to journal › Conference article › Research › peer-review

407 Downloads (Orbit)

Abstract

Access control policies are essential to determine who is allowed to access data in a system without compromising the data's security. However, applications inside a distributed environment may require those policies to be dependent on the actual content of the data, the flow of information, while also on other attributes of the environment such as the time. In this paper, we use systems of Timed Automata to model distributed systems and we present a logic in which one can express time-dependent policies for access control. We show how a fragment of our logic can be reduced to a logic that current model checkers for Timed Automata such as UPPAAL can handle and we present a translator that performs this reduction. We then use our translator and UPPAAL to enforce time-dependent policy-based access control on an example application from the aerospace industry.

Original language	English
Journal	Leibniz International Proceedings in Informatics
Volume	90
Number of pages	18
ISSN	1868-8969
DOIs	https://doi.org/10.4230/LIPIcs.TIME.2017.21
Publication status	Published - 2017
Event	24th International Symposium on Temporal Representation and Reasoning - Mons, Belgium Duration: 16 Oct 2017 → 18 Oct 2017 Conference number: 24

Conference

Conference	24th International Symposium on Temporal Representation and Reasoning
Number	24
Country/Territory	Belgium
City	Mons
Period	16/10/2017 → 18/10/2017

Keywords

Software
Access control
Time-dependent policies
Timed automata
UPPAAL
Aerospace industry
Automata theory
Computer circuits
Model checking
Network security
Access control policies
Current modeling
Distributed environments
Distributed systems
Policy based access control
Time dependent
Timed Automata
Computer Theory (Includes Formal Logic, Automata Theory, Switching Theory and Programming Theory)
Computer Circuits
Computer Software, Data Handling and Applications

Access to Document

10.4230/LIPIcs.TIME.2017.21

LIPIcs TIME 2017 21Final published version, 589 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{8d3741d9b8c64c1e834be85d09f391a4,

title = "Time dependent policy-based access control",

abstract = "Access control policies are essential to determine who is allowed to access data in a system without compromising the data's security. However, applications inside a distributed environment may require those policies to be dependent on the actual content of the data, the flow of information, while also on other attributes of the environment such as the time. In this paper, we use systems of Timed Automata to model distributed systems and we present a logic in which one can express time-dependent policies for access control. We show how a fragment of our logic can be reduced to a logic that current model checkers for Timed Automata such as UPPAAL can handle and we present a translator that performs this reduction. We then use our translator and UPPAAL to enforce time-dependent policy-based access control on an example application from the aerospace industry.",

keywords = "Software, Access control, Time-dependent policies, Timed automata, UPPAAL, Aerospace industry, Automata theory, Computer circuits, Model checking, Network security, Access control policies, Current modeling, Distributed environments, Distributed systems, Policy based access control, Time dependent, Timed Automata, Computer Theory (Includes Formal Logic, Automata Theory, Switching Theory and Programming Theory), Computer Circuits, Computer Software, Data Handling and Applications",

author = "Panagiotis Vasilikos and Flemming Nielson and Nielson, \{Hanne Riis\}",

year = "2017",

doi = "10.4230/LIPIcs.TIME.2017.21",

language = "English",

volume = "90",

journal = "Leibniz International Proceedings in Informatics",

issn = "1868-8969",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

note = "24th International Symposium on Temporal Representation and Reasoning, TIME 2017 ; Conference date: 16-10-2017 Through 18-10-2017",

}

TY - GEN

T1 - Time dependent policy-based access control

AU - Vasilikos, Panagiotis

AU - Nielson, Flemming

AU - Nielson, Hanne Riis

N1 - Conference code: 24

PY - 2017

Y1 - 2017

N2 - Access control policies are essential to determine who is allowed to access data in a system without compromising the data's security. However, applications inside a distributed environment may require those policies to be dependent on the actual content of the data, the flow of information, while also on other attributes of the environment such as the time. In this paper, we use systems of Timed Automata to model distributed systems and we present a logic in which one can express time-dependent policies for access control. We show how a fragment of our logic can be reduced to a logic that current model checkers for Timed Automata such as UPPAAL can handle and we present a translator that performs this reduction. We then use our translator and UPPAAL to enforce time-dependent policy-based access control on an example application from the aerospace industry.

AB - Access control policies are essential to determine who is allowed to access data in a system without compromising the data's security. However, applications inside a distributed environment may require those policies to be dependent on the actual content of the data, the flow of information, while also on other attributes of the environment such as the time. In this paper, we use systems of Timed Automata to model distributed systems and we present a logic in which one can express time-dependent policies for access control. We show how a fragment of our logic can be reduced to a logic that current model checkers for Timed Automata such as UPPAAL can handle and we present a translator that performs this reduction. We then use our translator and UPPAAL to enforce time-dependent policy-based access control on an example application from the aerospace industry.

KW - Software

KW - Access control

KW - Time-dependent policies

KW - Timed automata

KW - UPPAAL

KW - Aerospace industry

KW - Automata theory

KW - Computer circuits

KW - Model checking

KW - Network security

KW - Access control policies

KW - Current modeling

KW - Distributed environments

KW - Distributed systems

KW - Policy based access control

KW - Time dependent

KW - Timed Automata

KW - Computer Theory (Includes Formal Logic, Automata Theory, Switching Theory and Programming Theory)

KW - Computer Circuits

KW - Computer Software, Data Handling and Applications

U2 - 10.4230/LIPIcs.TIME.2017.21

DO - 10.4230/LIPIcs.TIME.2017.21

M3 - Conference article

SN - 1868-8969

VL - 90

JO - Leibniz International Proceedings in Informatics

JF - Leibniz International Proceedings in Informatics

T2 - 24th International Symposium on Temporal Representation and Reasoning

Y2 - 16 October 2017 through 18 October 2017

ER -

Time dependent policy-based access control

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this