 Solving the Workflow Satisfiability Problem using General Purpose
SolversIEEE Transactions on Dependable and Secure Computing (IEEE TDSC), 2021 |
 Towards Better Understanding of User Authorization Query Problem via
Multi-variable Complexity AnalysisACM Transactions on Privacy and Security (ACM TOPS), 2021 |
 Results in Workflow Resiliency: Complexity, New Formulation, and ASP
EncodingConference on Data and Application Security and Privacy (CODASPY), 2018 |
 The Authorization Policy Existence ProblemIEEE Transactions on Dependable and Secure Computing (IEEE TDSC), 2016 |
 Tight Lower Bounds for the Workflow Satisfiability Problem Based on the
Strong Exponential Time HypothesisInformation Processing Letters (IPL), 2015 |
