{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:00:21Z","timestamp":1781283621579,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","funder":[{"name":"National Science Foundation","award":["2047623"],"award-info":[{"award-number":["2047623"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,23]]},"DOI":"10.1145\/3800506.3803515","type":"proceedings-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:24:42Z","timestamp":1781281482000},"page":"35-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Active Learning of Negative Relationship-Based Authorizations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7335-9370","authenticated-orcid":false,"given":"Ferhat","family":"Demirkiran","sequence":"first","affiliation":[{"name":"Computer Science, University at Albany - SUNY, Albany, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0647-7785","authenticated-orcid":false,"given":"Amir","family":"Masoumzadeh","sequence":"additional","affiliation":[{"name":"Computer Science, University at Albany - SUNY, Albany, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Learning regular sets from queries and counterexamples. Information and computation","author":"Angluin Dana","year":"1987","unstructured":"Dana Angluin. 1987. Learning regular sets from queries and counterexamples. Information and computation, Vol. 75, 2 (1987), 87-106."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381991.3395619"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078861.3078878"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2018.09.011"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the Fifteenth ACM Conference on Data and Application Security and Privacy. 96-106","author":"Demirkiran Ferhat","year":"2025","unstructured":"Ferhat Demirkiran and Amir Masoumzadeh. 2025. Enhancing Relationship-Based Access Control Policies with Negative Rule Mining. In Proceedings of the Fifteenth ACM Conference on Data and Application Security and Privacy. 96-106."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the first ACM conference on Data and application security and privacy. 191-202","author":"Fong Philip WL","year":"2011","unstructured":"Philip WL Fong. 2011. Relationship-based access control: protection model and policy language. In Proceedings of the first ACM conference on Data and application security and privacy. 191-202."},{"key":"e_1_3_2_1_7_1","first-page":"12","article-title":"Access control requirements for web 2.0 security and privacy","volume":"2","author":"Gates Carrie","year":"2007","unstructured":"Carrie Gates. 2007. Access control requirements for web 2.0 security and privacy. IEEE Web, Vol. 2, 0 (2007), 12-15.","journal-title":"IEEE Web"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205977.3205988"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322431.3325419"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517121"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Conference on Organizing Workshops, Conferences, and Symposia for Computer Systems","author":"Kohler Eddie","year":"2008","unstructured":"Eddie Kohler. 2008. Hot Crap!. In Proceedings of the Conference on Organizing Workshops, Conferences, and Symposia for Computer Systems (San Francisco, California) (WOWCS'08). USENIX Association, USA, Article 11, 6 pages."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809842.1809852"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11334-022-00449-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2857705.2857706"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 30th ACM Symposium on Access Control Models and Technologies. 4-15","author":"Tripunitara Mahesh","year":"2025","unstructured":"Mahesh Tripunitara. 2025. Minimizing the number of roles in bottom-up role-mining using maximal biclique enumeration. In Proceedings of the 30th ACM Symposium on Access Control Models and Technologies. 4-15."}],"event":{"name":"CODASPY '26: Sixteenth ACM Conference on Data and Application Security and Privacy","location":"Frankfurt am Main Germany","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Data and Application Security and Privacy"],"original-title":[],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:29:01Z","timestamp":1781281741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3800506.3803515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,22]]},"references-count":15,"alternative-id":["10.1145\/3800506.3803515","10.1145\/3800506"],"URL":"https:\/\/doi.org\/10.1145\/3800506.3803515","relation":{},"subject":[],"published":{"date-parts":[[2026,6,22]]},"assertion":[{"value":"2026-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}