Speaker: Solomon Berhe
Day:  Wednesday, 10/24/2007
Room: ITEB 336
Time: 2:00-3:00pm

Title: 
Decidability of Safety in Graph-based Models for Access Control Models 

Abstract:
The safety analysis was first formalized by Harrison, Ruzzo and Ullman
[HRU76]. For a generic right, they proved the undecidability of the
question whether a given configuration of a protection system is safe .
Much work
has been done in developing access control models that are decidable by
restricting the models. However, many proposed models had not sufficient
expressive power for practical use. This paper introduces a graph-based
security framework to specify access control models. It will impose
reasonable restrictions to remain decidable and still maintain expressive
modeling power using graph transformation rules. In this talk, first the
prove why the safety property in an arbitrary access control model is
undecidable will be presented. Afterwards, the model proposed in this
paper, its restrictions and the proof why it is decidable will be
introduced. 

Reference: 
"Decidability of Safety in Graph-based Models for Access Control Models"
Manuel Koch , Luigi V. Mancini and Francesco Parisi-Presicce, In Proc. of
7th ESORICS, 2002