{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:37:39Z","timestamp":1752460659804,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319281650"},{"type":"electronic","value":"9783319281667"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28166-7_19","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T15:29:04Z","timestamp":1452266944000},"page":"389-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cryptographic Enforcement of Information Flow Policies Without Public Information"],"prefix":"10.1007","author":[{"given":"Jason","family":"Crampton","sequence":"first","affiliation":[]},{"given":"Naomi","family":"Farley","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Bertram","family":"Poettering","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1455526.1455531","volume":"12","author":"MJ Atallah","year":"2009","unstructured":"Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12(3), 18 (2009)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-74835-9_34","volume-title":"Computer Security \u2013 ESORICS 2007","author":"KB Frikken","year":"2007","unstructured":"Frikken, K.B., Atallah, M.J., Blanton, M.: Incorporating temporal capabilities in existing key management schemes. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 515\u2013530. Springer, Heidelberg (2007)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: Juels et al. [15], pp. 288\u2013297","DOI":"10.1145\/1180405.1180441"},{"key":"19_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bell, D., LaPadula, L.: Secure computer systems: Unified exposition and Multicsinterpretation. Technical report MTR-2997, Mitre Corporation, Bedford, Massachusetts (1976)","DOI":"10.21236\/ADA023588"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: IEEE Symposium on Security and Privacy, pp. 321\u2013334. IEEE Computer Society (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"19_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1952982.1952996","volume":"14","author":"J Crampton","year":"2011","unstructured":"Crampton, J.: Practical and efficient cryptographic enforcement of interval-based access control policies. ACM Trans. Inf. Syst. Secur. 14(1), 14 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-13739-6_9","volume-title":"Data and Applications Security and Privacy XXIV","author":"KM Martin","year":"2010","unstructured":"Martin, K.M., Crampton, J., Daud, R.: Constructing key assignment schemes from chain partitions. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV. LNCS, vol. 6166, pp. 130\u2013145. Springer, Heidelberg (2010)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: CSFW, pp. 98\u2013111. IEEE Computer Society (2006)","DOI":"10.1109\/CSFW.2006.20"},{"issue":"1\u20133","key":"19_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2008.05.021","volume":"407","author":"A De Santis","year":"2008","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: New constructions for provably-secure time-bound hierarchical key assignment schemes. Theor. Comput. Sci. 407(1\u20133), 213\u2013230 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-36095-4_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"ESV Freire","year":"2013","unstructured":"Freire, E.S.V., Poettering, B., Paterson, K.G.: Simple, efficient and strongly ki-secure hierarchical key assignment schemes. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 101\u2013114. Springer, Heidelberg (2013)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels et al. [15], pp. 89\u201398","DOI":"10.1145\/1180405.1180418"},{"issue":"45","key":"19_CR14","doi-asserted-by":"publisher","first-page":"4571","DOI":"10.1016\/j.tcs.2009.03.036","volume":"410","author":"G Gutin","year":"2009","unstructured":"Gutin, G., Razgon, I., Kim, E.J.: Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45), 4571\u20134579 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","unstructured":"Juels, A., Wright, R.N., di Vimercati, S.D.C., (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30 - November 3, 2006. ACM (2006)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(88)90099-3","volume":"27","author":"RS Sandhu","year":"1988","unstructured":"Sandhu, R.S.: Cryptographic implementation of a tree hierarchy for access control. Inf. Process. Lett. 27(2), 95\u201398 (1988)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28166-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:42:50Z","timestamp":1748745770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28166-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319281650","9783319281667"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28166-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}