Time Dependent Policy-Based Access Control

Vasilikos, Panagiotis; Nielson, Flemming; Nielson, Hanne Riis

doi:10.4230/lipics.time.2017.21

Search citation statements

Order By: Relevance

Paper Sections

Select...

Analyses Of Rbac Models1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [VNN17], Vasilikos et al propose a method for checking time dependent information flow on distributed systems, typically for RBAC models. The authors describe a branching-time logic extending CTL, called BTCTL, allowing comparisons between sets of variables, as well as checking if a configuration of variables holds before or after a given event.…”

Section: Analyses Of Rbac Modelsmentioning

confidence: 99%

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Arcile

André

2022

ACM Comput. Surv.

View full text Add to dashboard Cite

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata in the last two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.

show abstract

Section: Analyses Of Rbac Modelsmentioning

confidence: 99%