Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Resiliency is a relatively new topic in the context of access control. Informally, it refers to the extent to which a multi-user computer system, subject to an authorization policy, is able to continue functioning if a number of authorized users are unavailable. Several interesting problems connected to resiliency re introduced by Li, Wang and Tripunitara [13], many of which re found to be intractable. ,  show that these resiliency problems have unexpected connections with the workflow satisfiability problem (WSP). In particular,  show that an instance of the resiliency checking problem (RCP) may be reduced to an instance of WSP.  then demonstrate that recent advances in our understanding of WSP enable us to develop fixed-parameter tractable algorithms for RCP. Moreover, these algorithms are likely to be useful in practice, given recent experimental work demonstrating the advantages of bespoke algorithms to solve WSP.  also generalize RCP in several different ways, showing in each case how to adapt the reduction to WSP. Li  et al  also shod that the coexistence of resiliency policies and static separation-of-duty policies gives rise to further interesting questions.  show how our reduction of RCP to WSP may be extended to solve these problems as ll and establish that they are also fixed-parameter tractable.
['Jason Crampton', 'Gregory Gutin', 'Rémi Watrigant']
I am writing a research paper on a idea Resiliency Policies in Access Control Revisited
[{"from": "human", "value": "I am writing a research paper on a idea Resiliency Policies in Access Control Revisited"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Resiliency is a relatively new topic in the context of access control. Informally, it refers to the extent to which a multi-user computer system, subject to an authorization policy, is able to continue functioning if a number of authorized users are unavailable. Several interesting problems connected to resiliency re introduced by Li, Wang and Tripunitara [13], many of which re found to be intractable. ,  show that these resiliency problems have unexpected connections with the workflow satisfiability problem (WSP). In particular,  show that an instance of the resiliency checking problem (RCP) may be reduced to an instance of WSP.  then demonstrate that recent advances in our understanding of WSP enable us to develop fixed-parameter tractable algorithms for RCP. Moreover, these algorithms are likely to be useful in practice, given recent experimental work demonstrating the advantages of bespoke algorithms to solve WSP.  also generalize RCP in several different ways, showing in each case how to adapt the reduction to WSP. Li  et al  also shod that the coexistence of resiliency policies and static separation-of-duty policies gives rise to further interesting questions.  show how our reduction of RCP to WSP may be extended to solve these problems as ll and establish that they are also fixed-parameter tractable."}]