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.
@InProceedings{vasilikos_et_al:LIPIcs.TIME.2017.21, author = {Vasilikos, Panagiotis and Nielson, Flemming and Nielson, Hanne Riis}, title = {{Time Dependent Policy-Based Access Control}}, booktitle = {24th International Symposium on Temporal Representation and Reasoning (TIME 2017)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-052-1}, ISSN = {1868-8969}, year = {2017}, volume = {90}, editor = {Schewe, Sven and Schneider, Thomas and Wijsen, Jef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.21}, URN = {urn:nbn:de:0030-drops-79219}, doi = {10.4230/LIPIcs.TIME.2017.21}, annote = {Keywords: Access Control, Timed Automata, Time-Dependent Policies, UPPAAL} }
Feedback for Dagstuhl Publishing