{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T11:00:33Z","timestamp":1777806033424,"version":"3.51.4"},"reference-count":24,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCS"],"published-print":{"date-parts":[[2017,8,24]]},"DOI":"10.3233\/jcs-16863","type":"journal-article","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T15:36:42Z","timestamp":1496417802000},"page":"511-535","source":"Crossref","is-referenced-by-count":4,"title":["Cryptographic enforcement of information flow policies without public information via tree partitions1"],"prefix":"10.1177","volume":"25","author":[{"given":"Jason","family":"Crampton","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, UK"}]},{"given":"Naomi","family":"Farley","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, UK"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, UK"}]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, UK"}]},{"given":"Bertram","family":"Poettering","sequence":"additional","affiliation":[{"name":"Ruhr University Bochum, Germany"}]}],"member":"179","reference":[{"issue":"3","key":"10.3233\/JCS-16863_ref1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/357369.357372","article-title":"Cryptographic solution to a problem of access control in a hierarchy","volume":"1","author":"Akl","year":"1983","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.3233\/JCS-16863_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1455526.1455531"},{"key":"10.3233\/JCS-16863_ref3","doi-asserted-by":"crossref","unstructured":"M.J.\u00a0Atallah, M.\u00a0Blanton and K.B.\u00a0Frikken, Key management for non-tree access hierarchies, in: SACMAT 2006, 11th ACM Symposium on Access Control Models and Technologies, Proceedings, Lake Tahoe, California, USA, June 7\u20139, 2006, D.F.\u00a0Ferraiolo and I.\u00a0Ray, eds, ACM, 2006, pp.\u00a011\u201318.","DOI":"10.1145\/1133058.1133062"},{"key":"10.3233\/JCS-16863_ref4","doi-asserted-by":"crossref","unstructured":"M.J.\u00a0Atallah, M.\u00a0Blanton and K.B.\u00a0Frikken, Incorporating temporal capabilities in existing key management schemes, in: ESORICS, J.\u00a0Biskup and J.\u00a0Lopez, eds, Lecture Notes in Computer Science, Vol.\u00a04734, Springer, 2007, pp.\u00a0515\u2013530.","DOI":"10.1007\/978-3-540-74835-9_34"},{"issue":"2","key":"10.3233\/JCS-16863_ref5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00145-010-9094-6","article-title":"Provably-secure time-bound hierarchical key assignment schemes","volume":"25","author":"Ateniese","year":"2012","journal-title":"J. Cryptology"},{"key":"10.3233\/JCS-16863_ref6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bang-Jensen and G.\u00a0Gutin, Digraphs: Theory, Algorithms and Applications, 2nd edn, Springer, 2009.","DOI":"10.1007\/978-1-84800-998-1"},{"key":"10.3233\/JCS-16863_ref8","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bethencourt, A.\u00a0Sahai and B.\u00a0Waters, Ciphertext-policy attribute-based encryption, in: IEEE Symposium on Security and Privacy, IEEE Computer Society, 2007, pp.\u00a0321\u2013334.","DOI":"10.1109\/SP.2007.11"},{"key":"10.3233\/JCS-16863_ref9","doi-asserted-by":"crossref","unstructured":"J.\u00a0Black and P.\u00a0Rogaway, CBC MACs for arbitrary-length messages: The three-key constructions, in: Advances in Cryptology\u00a0\u2013 CRYPTO 2000, 20th Annual International Cryptology Conference, Proceedings, Santa Barbara, California, USA, August 20\u201324, 2000, M.\u00a0Bellare, ed., Lecture Notes in Computer Science, Vol.\u00a01880, Springer, 2000, pp.\u00a0197\u2013215.","DOI":"10.1007\/3-540-44598-6_12"},{"key":"10.3233\/JCS-16863_ref10","doi-asserted-by":"crossref","unstructured":"J.\u00a0Black and P.\u00a0Rogaway, A block-cipher mode of operation for parallelizable message authentication, in: Advances in Cryptology\u00a0\u2013 EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Amsterdam, The Netherlands, April 28\u2013May 2, 2002, L.R.\u00a0Knudsen, ed., Lecture Notes in Computer Science, Vol.\u00a02332, Springer, Amsterdam, The Netherlands, 2002, pp.\u00a0384\u2013397.","DOI":"10.1007\/3-540-46035-7_25"},{"key":"10.3233\/JCS-16863_ref12","unstructured":"T.H.\u00a0Cormen, C.E.\u00a0Leiserson, R.L.\u00a0Rivest and C.\u00a0Stein, Introduction to Algorithms, 3rd edn, MIT Press, 2009."},{"key":"10.3233\/JCS-16863_ref13","doi-asserted-by":"crossref","unstructured":"J.\u00a0Crampton, Practical and efficient cryptographic enforcement of interval-based access control policies, ACM Trans. Inf. Syst. Secur. 14(1) (2011), 14.","DOI":"10.1145\/1952982.1952996"},{"key":"10.3233\/JCS-16863_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13739-6_9"},{"key":"10.3233\/JCS-16863_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20810-7_23"},{"key":"10.3233\/JCS-16863_ref16","doi-asserted-by":"crossref","unstructured":"J.\u00a0Crampton, N.\u00a0Farley, G.\u00a0Gutin, M.\u00a0Jones and B.\u00a0Poettering, Cryptographic enforcement of information flow policies without public information, in: Applied Cryptography and Network Security\u00a0\u2013 13th International Conference, ACNS 2015, Revised Selected Papers, New York, NY, USA, June 2\u20135, 2015, T.\u00a0Malkin, V.\u00a0Kolesnikov, A.B.\u00a0Lewko and M.\u00a0Polychronakis, eds, Lecture Notes in Computer Science, Vol.\u00a09092, Springer, 2015, pp.\u00a0389\u2013408.","DOI":"10.1007\/978-3-319-28166-7_19"},{"key":"10.3233\/JCS-16863_ref17","doi-asserted-by":"crossref","unstructured":"J.\u00a0Crampton, K.M.\u00a0Martin and P.R.\u00a0Wild, On key assignment for hierarchical access control, in: CSFW, IEEE Computer Society, 2006, pp.\u00a098\u2013111.","DOI":"10.1109\/CSFW.2006.20"},{"key":"10.3233\/JCS-16863_ref20","doi-asserted-by":"crossref","unstructured":"E.S.V.\u00a0Freire and K.G.\u00a0Paterson, Provably secure key assignment schemes from factoring, in: Information Security and Privacy\u00a0\u2013 16th Australasian Conference, ACISP 2011. Proceedings, Melbourne, Australia, July 11\u201313, 2011, U.\u00a0Parampalli and P.\u00a0Hawkes, eds, Lecture Notes in Computer Science, Vol.\u00a06812, Springer, 2011, pp.\u00a0292\u2013309.","DOI":"10.1007\/978-3-642-22497-3_19"},{"key":"10.3233\/JCS-16863_ref21","doi-asserted-by":"crossref","unstructured":"E.S.V.\u00a0Freire, K.G.\u00a0Paterson and B.\u00a0Poettering, Simple, efficient and strongly KI-secure hierarchical key assignment schemes, in: Topics in Cryptology\u00a0\u2013 CT-RSA 2013\u00a0\u2013 The Cryptographers\u2019 Track at the RSA Conference 2013. Proceedings, San Francisco, CA, USA, February 25\u2013March 1, 2013, E.\u00a0Dawson, ed., Lecture Notes in Computer Science, Vol.\u00a07779, Springer, 2013, pp.\u00a0101\u2013114.","DOI":"10.1007\/978-3-642-36095-4_7"},{"key":"10.3233\/JCS-16863_ref22","first-page":"181","article-title":"Verallgemeinerung eines Graphentheoretischen Satzes von R\u00e9dei","volume":"21","author":"Gallai","year":"1960","journal-title":"Acta Sci. Math."},{"key":"10.3233\/JCS-16863_ref23","doi-asserted-by":"crossref","unstructured":"V.K.\u00a0Garg, Introduction to Lattice Theory with Computer Science Applications, Wiley, 2015.","DOI":"10.1002\/9781119069706"},{"key":"10.3233\/JCS-16863_ref24","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, O.\u00a0Pandey, A.\u00a0Sahai and B.\u00a0Waters, Attribute-based encryption for fine-grained access control of encrypted data, in: ACM Conference on Computer and Communications Security, A.\u00a0Juels, R.N.\u00a0Wright and S.D.C.\u00a0di\u00a0Vimercati, eds, ACM, 2006, pp.\u00a089\u201398.","DOI":"10.1145\/1180405.1180418"},{"issue":"45","key":"10.3233\/JCS-16863_ref25","doi-asserted-by":"publisher","first-page":"4571","DOI":"10.1016\/j.tcs.2009.03.036","article-title":"Minimum leaf out-branching and related problems","volume":"410","author":"Gutin","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.3233\/JCS-16863_ref26","unstructured":"National Institute of Standards and Technology. FIPS 198-1, The Keyed-Hash Message Authentication Code, Federal Information Processing Standard (FIPS), Publication 198-1. Technical report, Department of Commerce, 2008."},{"issue":"2","key":"10.3233\/JCS-16863_ref27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(88)90099-3","article-title":"Cryptographic implementation of a tree hierarchy for access control","volume":"27","author":"Sandhu","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"10.3233\/JCS-16863_ref28","doi-asserted-by":"crossref","unstructured":"S.\u00a0Yu, C.\u00a0Wang, K.\u00a0Ren and W.\u00a0Lou, Achieving secure, scalable, and fine-grained data access control in cloud computing, in: INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, San Diego, CA, USA, 15\u201319 March 2010, IEEE, 2010, pp.\u00a0534\u2013542.","DOI":"10.1109\/INFCOM.2010.5462174"}],"container-title":["Journal of Computer Security"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCS-16863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:05Z","timestamp":1777495505000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/JCS-16863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,24]]},"references-count":24,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jcs-16863","relation":{},"ISSN":["1875-8924","0926-227X"],"issn-type":[{"value":"1875-8924","type":"electronic"},{"value":"0926-227X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8,24]]}}}