{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T08:02:14Z","timestamp":1784534534992,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032332592","type":"print"},{"value":"9783032332608","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-33260-8_12","type":"book-chapter","created":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T07:07:33Z","timestamp":1784531253000},"page":"224-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Anonymous Hierarchical Key Assignment Schemes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7717-0508","authenticated-orcid":false,"given":"Roberta","family":"Cimorelli Belfiore","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8962-1919","authenticated-orcid":false,"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1026-5729","authenticated-orcid":false,"given":"Anna Lisa","family":"Ferrara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5676-6900","authenticated-orcid":false,"given":"Manuela","family":"Flores","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1570-8576","authenticated-orcid":false,"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,21]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"SG Akl","year":"1983","unstructured":"Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1(3), 239\u2013248 (1983). https:\/\/doi.org\/10.1145\/357369.357372","journal-title":"ACM Trans. Comput. Syst."},{"key":"12_CR2","doi-asserted-by":"publisher","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:1\u201318:43 (2009). https:\/\/doi.org\/10.1145\/1455526.1455531","DOI":"10.1145\/1455526.1455531"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Ateniese, G., De\u00a0Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 288\u2013297. CCS \u201906, Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1180405.1180441","DOI":"10.1145\/1180405.1180441"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/S00145-010-9094-6","volume":"25","author":"G Ateniese","year":"2012","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. J. Cryptol. 25(2), 243\u2013270 (2012). https:\/\/doi.org\/10.1007\/S00145-010-9094-6","journal-title":"J. Cryptol."},{"issue":"5\u20136","key":"12_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ipl.2013.01.006","volume":"113","author":"G Ateniese","year":"2013","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: A note on time-bound hierarchical key assignment schemes. Inf. Process. Lett. 113(5\u20136), 151\u2013155 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.01.006","journal-title":"Inf. Process. Lett."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings. pp. 258\u2013275. LNCS. Springer (2005). https:\/\/doi.org\/10.1007\/11535218_16","DOI":"10.1007\/11535218_16"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TDSC.2014.2355841","volume":"12","author":"M Cafaro","year":"2015","unstructured":"Cafaro, M., Civino, R., Masucci, B.: On the equivalence of two security notions for hierarchical key assignment schemes in the unconditional setting. IEEE Trans. Dependable Secur. Comput. 12(4), 485\u2013490 (2015). https:\/\/doi.org\/10.1109\/TDSC.2014.2355841","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TDSC.2015.2413415","volume":"13","author":"A Castiglione","year":"2016","unstructured":"Castiglione, A., De Santis, A., Masucci, B.: Key indistinguishability versus strong key indistinguishability for hierarchical key assignment schemes. IEEE Trans. Dependable Secure Comput. 13(4), 451\u2013460 (2016). https:\/\/doi.org\/10.1109\/TDSC.2015.2413415","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Castiglione, A., De Santis, A., Masucci, B., Palmieri, F., Castiglione, A.: On the relations between security notions in hierarchical key assignment schemes for dynamic structures. In: Liu, J.K., Steinfeld, R. (eds.) Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II. pp. 37\u201354. LNCS. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40367-0_3","DOI":"10.1007\/978-3-319-40367-0_3"},{"issue":"10","key":"12_CR10","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1109\/TIFS.2016.2581147","volume":"11","author":"A Castiglione","year":"2016","unstructured":"Castiglione, A., De Santis, A., Masucci, B., Palmieri, F., Castiglione, A., Huang, X.: Cryptographic hierarchical access control for dynamic structures. IEEE Trans. Inf. Forensics Secur. 11(10), 2349\u20132364 (2016). https:\/\/doi.org\/10.1109\/TIFS.2016.2581147","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/TIFS.2015.2512533","volume":"11","author":"A Castiglione","year":"2016","unstructured":"Castiglione, A., De Santis, A., Masucci, B., Palmieri, F., Castiglione, A., Li, J., Huang, X.: Hierarchical and shared access control. IEEE Trans. Inf. Forensics Secur. 11(4), 850\u2013865 (2016). https:\/\/doi.org\/10.1109\/TIFS.2015.2512533","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/J.INS.2016.08.093","volume":"387","author":"A Castiglione","year":"2017","unstructured":"Castiglione, A., De Santis, A., Masucci, B., Palmieri, F., Huang, X., Castiglione, A.: Supporting dynamic updates in storage clouds with the Akl-Taylor scheme. Inf. Sci. 387, 56\u201374 (2017). https:\/\/doi.org\/10.1016\/J.INS.2016.08.093","journal-title":"Inf. Sci."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Castiglione, A., Santis, A.D., Masucci, B.: Hierarchical and shared key assignment. In: Proceedings of the 2014 17th International Conference on Network-Based Information Systems. p. 263\u2013270. NBIS \u201914. IEEE Computer Society, USA (2014). https:\/\/doi.org\/10.1109\/NBiS.2014.106","DOI":"10.1109\/NBiS.2014.106"},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0167-4048(02)01016-7","volume":"21","author":"TS Chen","year":"2002","unstructured":"Chen, T.S., Chung, Y.F.: Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Comput. Secur. 21(6), 565\u2013570 (2002). https:\/\/doi.org\/10.1016\/S0167-4048(02)01016-7","journal-title":"Comput. Secur."},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Cimorelli Belfiore, R., De Santis, A., Ferrara, A.L., Masucci, B.: Hierarchical key assignment schemes with key rotation. In: Niu, J., Vaidya, J. (eds.) Proceedings of the 29th ACM Symposium on Access Control Models and Technologies, SACMAT 2024, San Antonio, TX, USA, May 15-17, 2024. ACM (2024). https:\/\/doi.org\/10.1145\/3649158.3657037","DOI":"10.1145\/3649158.3657037"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Crampton, J., Daud, R., Martin, K.M.: Constructing key assignment schemes from chain partitions. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV, 24th Annual IFIP WG 11.3 Working Conference, Rome, Italy, June 21-23, 2010. Proceedings, pp. 130\u2013145. Lecture Notes in Computer Science, Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13739-6_9","DOI":"10.1007\/978-3-642-13739-6_9"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: 19th IEEE Computer Security Foundations Workshop, (CSFW-19 2006), 5-7 July 2006, Venice, Italy, pp. 98\u2013111. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/CSFW.2006.20","DOI":"10.1109\/CSFW.2006.20"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/J.TCS.2009.09.028","volume":"411","author":"P D\u2019Arco","year":"2010","unstructured":"D\u2019Arco, P., De Santis, A., Ferrara, A.L., Masucci, B.: Variations on a theme by Akl and Taylor: Security and tradeoffs. Theor. Comput. Sci. 411(1), 213\u2013227 (2010). https:\/\/doi.org\/10.1016\/J.TCS.2009.09.028","journal-title":"Theor. Comput. Sci."},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"De Capitani di Vimercati, S., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: A data outsourcing architecture combining cryptography and access control. In: Ning, P., Atluri, V. (eds.) Proceedings of the 2007 ACM workshop on Computer Security Architecture, CSAW 2007, Fairfax, VA, USA, November 2, 2007 pp. 63\u201369. ACM (2007). https:\/\/doi.org\/10.1145\/1314466.1314477","DOI":"10.1145\/1314466.1314477"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"De Capitani di Vimercati, S., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: Encryption policies for regulating access to outsourced data. ACM Trans. Database Syst. 35(2), 12:1\u201312:46 (2010). https:\/\/doi.org\/10.1145\/1735886.1735891","DOI":"10.1145\/1735886.1735891"},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2004.03.019","volume":"92","author":"A De Santis","year":"2004","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Cryptographic key assignment schemes for any access control policy. Inf. Process. Lett. 92(4), 199\u2013205 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2004.03.019","journal-title":"Inf. Process. Lett."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: A new key assignment scheme for access control in a complete tree hierarchy. In: Proc. of WCC 2005, pp. 202\u2013217 (2005). https:\/\/doi.org\/10.1007\/11779360_17","DOI":"10.1007\/11779360_17"},{"issue":"12","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.ins.2005.07.002","volume":"176","author":"A De Santis","year":"2006","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Enforcing the security of a time-bound hierarchical key assignment scheme. Inf. Sci. 176(12), 1684\u20131694 (2006). https:\/\/doi.org\/10.1016\/j.ins.2005.07.002","journal-title":"Inf. Sci."},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Efficient provably-secure hierarchical key assignment schemes. In: Proc. of MFCS 2007. LNCS, vol.\u00a04708, pp. 371\u2013382 (2007). https:\/\/doi.org\/10.1007\/978-3-540-74456-6_34","DOI":"10.1007\/978-3-540-74456-6_34"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: New constructions for provably-secure time-bound hierarchical key assignment schemes. In: Proc. of SACMAT, pp. 133\u2013138 (2007). https:\/\/doi.org\/10.1145\/1266840.1266861","DOI":"10.1145\/1266840.1266861"},{"issue":"1\u20133","key":"12_CR26","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). https:\/\/doi.org\/10.1016\/j.tcs.2008.05.021","journal-title":"Theor. Comput. Sci."},{"issue":"41","key":"12_CR27","doi-asserted-by":"publisher","first-page":"5684","DOI":"10.1016\/J.TCS.2011.06.024","volume":"412","author":"A De Santis","year":"2011","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Efficient provably-secure hierarchical key assignment schemes. Theor. Comput. Sci. 412(41), 5684\u20135699 (2011). https:\/\/doi.org\/10.1016\/J.TCS.2011.06.024","journal-title":"Theor. Comput. Sci."},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Ferrara, A.L., Paci, F., Ricciardi, C.: Verifiable hierarchical key assignment schemes. In: Barker, K., Ghazinour, K. (eds.) Data and Applications Security and Privacy XXXV - 35th Annual IFIP WG 11.3 Conference, DBSec 2021, Calgary, Canada, July 19-20, 2021, Proceedings, pp. 357\u2013376. LNCS. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81242-3_21","DOI":"10.1007\/978-3-030-81242-3_21"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Freire, E.S.V., Paterson, K.G., Poettering, B.: Simple, efficient and strongly ki-secure hierarchical key assignment schemes. In: Proceedings of the 13th International Conference on Topics in Cryptology, pp. 101\u2013114. CT-RSA\u201913. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_7","DOI":"10.1007\/978-3-642-36095-4_7"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/S00145-005-0310-8","volume":"19","author":"J Katz","year":"2006","unstructured":"Katz, J., Yung, M.: Characterization of security notions for probabilistic private-key encryption. J. Cryptol. 19(1), 67\u201395 (2006). https:\/\/doi.org\/10.1007\/S00145-005-0310-8","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-33260-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T07:07:34Z","timestamp":1784531254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-33260-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032332592","9783032332608"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-33260-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"21 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arlington, VA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dbsec2026.gmu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}