{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T04:18:09Z","timestamp":1771042689425,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2020-05238"],"award-info":[{"award-number":["RGPIN-2020-05238"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,7]]},"DOI":"10.1145\/3532105.3535026","type":"proceedings-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T14:29:57Z","timestamp":1654698597000},"page":"223-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Higher-Order Relationship-Based Access Control: A Temporal Instantiation with IoT Applications"],"prefix":"10.1145","author":[{"given":"Chahal","family":"Arora","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed Zain R.","family":"Rizvi","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip W.L.","family":"Fong","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Master's thesis","author":"Arora Chahal","year":"1880","unstructured":"Chahal Arora . 2022. Higher-Order (Temporal) Relationship-Based Access Control. Master's thesis . University of Calgary . http:\/\/hdl.handle.net\/ 1880 \/114433 Chahal Arora. 2022. Higher-Order (Temporal) Relationship-Based Access Control. Master's thesis. University of Calgary. http:\/\/hdl.handle.net\/1880\/114433"},{"key":"e_1_3_2_1_2_1","volume-title":"Mathematical logic for computer science","author":"Ben-Ari M.","unstructured":"M. Ben-Ari . 2001. Mathematical logic for computer science ( 2 nd ed.). Springer . M. Ben-Ari. 2001. Mathematical logic for computer science (2nd ed.). Springer.","edition":"2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/501978.501979"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133616"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Yuan Cheng Jaehong Park and Ravi Sandhu. 2012. Relationship-Based Access Control for Online Social Networks: Beyond User-to-User Relationships. In 2012 International Conference on Privacy Security Risk and Trust and 2012 International Confernece on Social Computing. 646--655.  Yuan Cheng Jaehong Park and Ravi Sandhu. 2012. Relationship-Based Access Control for Online Social Networks: Beyond User-to-User Relationships. In 2012 International Conference on Privacy Security Risk and Trust and 2012 International Confernece on Social Computing. 646--655.","DOI":"10.1109\/SocialCom-PASSAT.2012.57"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2613087.2613094"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301314"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1943513.1943539"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516720"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of the 16th ACM Symp. on Access Control Models & Technologies (SACMAT '11)","author":"Philip","unstructured":"Philip W.L. Fong and Ida Siahaan. 2011. Relationship-Based Access Control Policies and Their Policy Languages . In Proc. of the 16th ACM Symp. on Access Control Models & Technologies (SACMAT '11) . 51--60. Philip W.L. Fong and Ida Siahaan. 2011. Relationship-Based Access Control Policies and Their Policy Languages. In Proc. of the 16th ACM Symp. on Access Control Models & Technologies (SACMAT '11). 51--60."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00102"},{"key":"e_1_3_2_1_13_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. Freeman.  M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. Freeman."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"P. Hell and J. Nesetril. 2004. Graphs and Homomorphisms. Oxford Univ. Press.  P. Hell and J. Nesetril. 2004. Graphs and Homomorphisms. Oxford Univ. Press.","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"e_1_3_2_1_15_1","first-page":"175","article-title":"\u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkte","volume":"32","author":"Helly Ed.","year":"1923","unstructured":"Ed. Helly . 1923 . \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkte . Jahresbericht der Deutschen Mathematiker-Vereinigung 32 (1923), 175 -- 176 . Ed. Helly. 1923. \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkte. Jahresbericht der Deutschen Mathematiker-Vereinigung 32 (1923), 175--176.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322431.3325419"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043621.2043623"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370684.1370686"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2613087.2613101"},{"key":"e_1_3_2_1_21_1","unstructured":"Jure Leskovec. 2022. Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data  Jure Leskovec. 2022. Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455526.1455532"},{"key":"e_1_3_2_1_23_1","volume-title":"Qualitative spatial and temporal reasoning","author":"Ligozat G\u00e9rard","unstructured":"G\u00e9rard Ligozat . 2012. Qualitative spatial and temporal reasoning . Wiley . G\u00e9rard Ligozat. 2012. Qualitative spatial and temporal reasoning. Wiley."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078861.3078871"},{"key":"e_1_3_2_1_25_1","volume-title":"Fong","author":"Pereira Henrique G. G.","year":"2019","unstructured":"Henrique G. G. Pereira and Philip W. L . Fong . 2019 . SEPD : An Access Control Model for Resource Sharing in an IoT Environment. In Computer Security -- ESORICS 2019, K. Sako, S. Schneider, and P. Y. A. Ryan (Eds.). Springer , 195--216. Henrique G. G. Pereira and Philip W. L. Fong. 2019. SEPD: An Access Control Model for Resource Sharing in an IoT Environment. In Computer Security -- ESORICS 2019, K. Sako, S. Schneider, and P. Y. A. Ryan (Eds.). Springer, 195--216."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2021.02.004"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of the 8th ACM Conf. on Data & Application Security & Privacy (CODASPY '18)","author":"Syed Zain","unstructured":"Syed Zain R. Rizvi and Philip W. L. Fong. 2018. Efficient Authorization of Graph Database Queries in an Attribute-Supporting ReBAC Model . In Proc. of the 8th ACM Conf. on Data & Application Security & Privacy (CODASPY '18) . 204--211. Syed Zain R. Rizvi and Philip W. L. Fong. 2018. Efficient Authorization of Graph Database Queries in an Attribute-Supporting ReBAC Model. In Proc. of the 8th ACM Conf. on Data & Application Security & Privacy (CODASPY '18). 204--211."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3401027"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00667-4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/353323.353382"},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. 17th ACM Symp. on Access Control Models & Tech. (SACMAT '12)","author":"Uzun E.","unstructured":"E. Uzun , V. Atluri , S. Sural , J. Vaidya , G. Parlato , A. L. Ferrara , and M. Parthasarathy . 2012. Analyzing Temporal Role Based Access Control Models . In Proc. 17th ACM Symp. on Access Control Models & Tech. (SACMAT '12) . 177--186. E. Uzun, V. Atluri, S. Sural, J. Vaidya, G. Parlato, A. L. Ferrara, and M. Parthasarathy. 2012. Analyzing Temporal Role Based Access Control Models. In Proc. 17th ACM Symp. on Access Control Models & Tech. (SACMAT '12). 177--186."},{"key":"e_1_3_2_1_34_1","volume-title":"Handbook of Constraint Programming","author":"van Beek Peter","unstructured":"Peter van Beek . 2006. Backtracking search algorithms . In Handbook of Constraint Programming . Elsevier . Peter van Beek. 2006. Backtracking search algorithms. In Handbook of Constraint Programming. Elsevier."}],"event":{"name":"SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies","location":"New York NY USA","acronym":"SACMAT '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532105.3535026","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532105.3535026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:14Z","timestamp":1750183754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532105.3535026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,7]]},"references-count":34,"alternative-id":["10.1145\/3532105.3535026","10.1145\/3532105"],"URL":"https:\/\/doi.org\/10.1145\/3532105.3535026","relation":{},"subject":[],"published":{"date-parts":[[2022,6,7]]},"assertion":[{"value":"2022-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}