{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:17:39Z","timestamp":1782371859611,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC","award":["532264-2018"],"award-info":[{"award-number":["532264-2018"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,24]]},"DOI":"10.1145\/3589608.3593840","type":"proceedings-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T22:15:11Z","timestamp":1684966511000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The Hardness of Learning Access Control Policies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8385-4082","authenticated-orcid":false,"given":"Xiaomeng","family":"Lei","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3615-9393","authenticated-orcid":false,"given":"Mahesh","family":"Tripunitara","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas","year":"2022","unstructured":"Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms, Fourth Edition. MIT Press, 2022."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00011"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377838"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1943513.1943539"},{"key":"e_1_3_2_1_6_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90562-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/360303.360333"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568455"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800--162"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381991.3395614"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517121"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"e_1_3_2_1_15_1","volume-title":"The graph isomorphism problem: its structural complexity","author":"Kobler Johannes","year":"2012","unstructured":"Johannes Kobler, Uwe Sch\u00f6ning, and Jacobo Tor\u00e1n. The graph isomorphism problem: its structural complexity. Springer Science & Business Media, 2012."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2752952.2752969"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808138.2808151"},{"key":"e_1_3_2_1_18_1","volume-title":"A survey of role mining. ACM Comput. Surv., 48(4), feb","author":"Mitra Barsha","year":"2016","unstructured":"Barsha Mitra, Shamik Sural, Jaideep Vaidya, and Vijayalakshmi Atluri. A survey of role mining. ACM Comput. Surv., 48(4), feb 2016."},{"key":"e_1_3_2_1_19_1","volume-title":"Machine learning in access control: A taxonomy and survey. https:\/\/arxiv.org\/abs\/2207.01739","author":"Nobi Mohammad Nur","year":"2022","unstructured":"Mohammad Nur Nobi, Maanak Gupta, Lopamudra Praharaj, Mahmoud Abdelsalam, Ram Krishnan, and Ravi Sandhu. Machine learning in access control: A taxonomy and survey. https:\/\/arxiv.org\/abs\/2207.01739, 2022."},{"key":"e_1_3_2_1_20_1","volume-title":"Computational limitations on learning from examples. Journal of the ACM (JACM), 35(4):965--984","author":"Pitt Leonard","year":"1988","unstructured":"Leonard Pitt and Leslie G Valiant. Computational limitations on learning from examples. Journal of the ACM (JACM), 35(4):965--984, 1988."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/361011.361067"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2369048"}],"event":{"name":"SACMAT '23: The 28th ACM Symposium on Access Control Models and Technologies","location":"Trento Italy","acronym":"SACMAT '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 28th ACM Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589608.3593840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589608.3593840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:45Z","timestamp":1750291425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589608.3593840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":24,"alternative-id":["10.1145\/3589608.3593840","10.1145\/3589608"],"URL":"https:\/\/doi.org\/10.1145\/3589608.3593840","relation":{},"subject":[],"published":{"date-parts":[[2023,5,24]]},"assertion":[{"value":"2023-05-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}