{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:32:11Z","timestamp":1777372331274,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2018-161"],"award-info":[{"award-number":["RPG-2018-161"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,11]]},"DOI":"10.1145\/3450569.3463571","type":"proceedings-article","created":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T04:06:33Z","timestamp":1623470793000},"page":"83-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Valued Authorization Policy Existence Problem"],"prefix":"10.1145","author":[{"given":"Jason","family":"Crampton","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard","family":"Eiben","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Karapetyan","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottigham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2883416"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/300830.300837"},{"key":"e_1_3_2_1_3_1","volume-title":"STM (Lecture Notes in Computer Science","volume":"156","author":"Chen Liang","year":"2011","unstructured":"Liang Chen and Jason Crampton. 2011. Risk-Aware Role-Based Access Control. In STM (Lecture Notes in Computer Science, Vol. 7170). Springer, 140--156."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4435"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.003"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2914642.2914650"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487222.2487226"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Jason Crampton Gregory Z. Gutin and Daniel Karapetyan. 2015. Valued Workflow Satisfiability Problem. In SACMAT. ACM 3--13.","DOI":"10.1145\/2752952.2752961"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-16849"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"M. Cygan F.V. Fomin L. Kowalik D. Lokshtanov D. Marx M. Pilipczuk M. Pilipczuk and S. Saurabh. 2015. Parameterized Algorithms. Springer.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Nathan Dimmock Andr\u00e1s Belokosztolszki David M. Eyers Jean Bacon and Ken Moody. 2004. Using trust and risk in role-based access control policies. In SACMAT. ACM 156--162.","DOI":"10.1145\/990036.990062"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows. 2013. Fundamentals of Parameterized Complexity .Springer.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"e_1_3_2_1_13_1","unstructured":"Philip W. L. Fong. 2019. Results in Workflow Resiliency: Complexity New Formulation and ASP Encoding. In CODASPY. ACM 185--196."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766282"},{"key":"e_1_3_2_1_15_1","volume-title":"Extremal Combinatorics - With Applications in Computer Science","author":"Jukna Stasys","unstructured":"Stasys Jukna. 2001. Extremal Combinatorics - With Applications in Computer Science .Springer."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11339"},{"key":"e_1_3_2_1_17_1","volume-title":"Variants of the Hungarian method for assignment problems. Naval research logistics quarterly","author":"Kuhn Harold W","year":"1956","unstructured":"Harold W Kuhn. 1956. Variants of the Hungarian method for assignment problems. Naval research logistics quarterly, Vol. 3, 4 (1956), 253--258."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513601.1513602"},{"key":"e_1_3_2_1_19_1","first-page":"41","article-title":"Lower bounds based on the Exponential Time","volume":"105","author":"Lokshtanov Daniel","year":"2011","unstructured":"Daniel Lokshtanov, D\u00e1niel Marx, and Saket Saurabh. 2011. Lower bounds based on the Exponential Time Hypothesis. Bull. EATCS, Vol. 105 (2011), 41--72.","journal-title":"Hypothesis. Bull. EATCS"},{"key":"e_1_3_2_1_20_1","volume-title":"van Moorsel","author":"Mace John C.","year":"2014","unstructured":"John C. Mace, Charles Morisset, and Aad P. A. van Moorsel. 2014. Quantitative Workflow Resiliency. In ESORICS (1) (Lecture Notes in Computer Science, Vol. 8712). Springer, 344--361."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629502"},{"key":"e_1_3_2_1_22_1","volume-title":"Break-Glass - Handling Exceptional Situations in Access Control","author":"Petritsch Helmut","unstructured":"Helmut Petritsch. 2014. Break-Glass - Handling Exceptional Situations in Access Control .Springer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880034"}],"event":{"name":"SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies","location":"Virtual Event Spain","acronym":"SACMAT '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 26th ACM Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450569.3463571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3450569.3463571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:50Z","timestamp":1750193270000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450569.3463571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,11]]},"references-count":24,"alternative-id":["10.1145\/3450569.3463571","10.1145\/3450569"],"URL":"https:\/\/doi.org\/10.1145\/3450569.3463571","relation":{},"subject":[],"published":{"date-parts":[[2021,6,11]]},"assertion":[{"value":"2021-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}