{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T20:26:09Z","timestamp":1775075169556,"version":"3.50.1"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>The enforcement of access control policies using cryptography has received considerable attention in recent years and the security of such enforcement schemes is increasingly well understood. Recent work in the area has considered the efficient enforcement of temporal and geo-spatial access control policies, and asymptotic results for the time and space complexity of efficient enforcement schemes have been obtained. However, for practical purposes, it is useful to have explicit bounds for the complexity of enforcement schemes.<\/jats:p>\n          <jats:p>In this article we consider interval-based access control policies, of which temporal and geo-spatial access control policies are special cases. We define enforcement schemes for interval-based access control policies for which it is possible, in almost all cases, to obtain exact values for the schemes' complexity, thereby subsuming a substantial body of work in the literature. Moreover, our enforcement schemes are more practical than existing schemes, in the sense that they operate in the same way as standard cryptographic enforcement schemes, unlike other efficient schemes in the literature. The main difference between our approach and earlier work is that we develop techniques that are specific to the cryptographic enforcement of interval-based access control policies, rather than applying generic techniques that give rise to complex constructions and asymptotic bounds.<\/jats:p>","DOI":"10.1145\/1952982.1952996","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:51:38Z","timestamp":1307361098000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Practical and efficient cryptographic enforcement of interval-based access control policies"],"prefix":"10.1145","volume":"14","author":[{"given":"Jason","family":"Crampton","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/357369.357372"},{"key":"e_1_2_1_2_1","unstructured":"Alon N. and Schiebe R. B. 1987. Optimal preprocessing for answering on-line product queries. Tech. rep. TR 71\/87 Institute of Computer Science Tel-Aviv University.  Alon N. and Schiebe R. B. 1987. Optimal preprocessing for answering on-line product queries. Tech. rep. TR 71\/87 Institute of Computer Science Tel-Aviv University."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455526.1455531"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133058.1133062"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229285.1229301"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 12th European Symposium on Research in Computer Security. 515--530","author":"Atallah M."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180441"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_21"},{"key":"e_1_2_1_9_1","volume-title":"Secure computer systems: Unified exposition and Multics interpretation. Tech. rep. MTR-2997","author":"Bell D."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/501978.501979"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586116"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.11"},{"key":"e_1_2_1_13_1","first-page":"111","article-title":"Trade-offs in non-reversing diameter","volume":"1","author":"Bodlaender H.","year":"1994","journal-title":"Nordic J. Comput."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0442-5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3089844.3089852"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of 7th International Workshop on Formal Aspects of Security &amp; Trust. 191--205","author":"Crampton J.","year":"2010"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.20"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Davey B. and Priestley H. 2002. Introduction to Lattices and Order 2nd Ed. Cambridge University Press Cambridge UK.  Davey B. and Priestley H. 2002. Introduction to Lattices and Order 2nd Ed. Cambridge University Press Cambridge UK.","DOI":"10.1017\/CBO9780511809088"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science. 371--382","author":"Desantis A."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266840.1266861"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.021"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371374"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium (NDSS'06)","author":"Fu K."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of INFOCOM'08","author":"Srivatsa M."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001668"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802185"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653839"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1952982.1952996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:41Z","timestamp":1750244381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.1145\/1952982.1952996"],"URL":"https:\/\/doi.org\/10.1145\/1952982.1952996","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"2010-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}