Abstract
This paper considers the safety problem for the pre-authorization sub-model of the well-known <inline-formula> <tex-math notation="LaTeX">$UCON_{ABC}$</tex-math></inline-formula> usage control model, that is, <inline-formula><tex-math notation="LaTeX">$Pre\_UCON_A$ </tex-math></inline-formula> . It is shown that <inline-formula><tex-math notation="LaTeX">$Pre\_UCON_A$</tex-math></inline-formula> with finite attribute domains has decidable safety even if arbitrary object creation is allowed. This result eliminates the previously known restrictions for obtaining safety decidability in this context, which only allow a finite bounded number of objects to be created. Our result specifically permits unbounded object creation, so the set of objects is potentially infinite. In the proof, we show that the set of reachable protection tuples in infinite state <inline-formula> <tex-math notation="LaTeX">$Pre\_UCON_A$</tex-math></inline-formula> models is finite and computable. We also provide a construction for decision procedure which answers the safety question by examining the reachable protection tuples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Dependable and Secure Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
