{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:14:33Z","timestamp":1784556873230,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319403663","type":"print"},{"value":"9783319403670","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40367-0_3","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T14:53:42Z","timestamp":1467212022000},"page":"37-54","source":"Crossref","is-referenced-by-count":5,"title":["On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures"],"prefix":"10.1007","author":[{"given":"Arcangelo","family":"Castiglione","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Palmieri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniello","family":"Castiglione","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972). doi: 10.1137\/0201008","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR2","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). doi: 10.1145\/357369.357372","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"3_CR3","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). doi: 10.1145\/1455526.1455531","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"3_CR4","unstructured":"Atallah, M.J., Blanton, M., Frikken, K.B.: Key management for non-tree access hierarchies. In: Ferraiolo, D.F., Ray, I. (eds.) Proceedings of the 11th ACM Symposium on Access Control Models and Technologies, SACMAT 2006, Lake Tahoe, California, USA, 7\u20139 June 2006, pp. 11\u201318. ACM (2006). http:\/\/doi.acm.org\/10.1145\/1133058.1133062"},{"key":"3_CR5","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":"MJ Atallah","year":"2007","unstructured":"Atallah, M.J., Blanton, M., Frikken, K.B.: 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). doi: 10.1007\/978-3-540-74835-9_34"},{"key":"3_CR6","unstructured":"Atallah, M.J., Frikken, K.B., Blanton, M.: Dynamic and efficient key management for access hierarchies. In: Atluri, V., Meadows, C., Juels, A. (eds.) Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, Alexandria, VA, USA, 7\u201311 November 2005, pp. 190\u2013202. ACM (2005). http:\/\/doi.acm.org\/10.1145\/1102120.1102147"},{"key":"3_CR7","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-securetime-bound hierarchical key assignment schemes. In: Juels, A., Wright, R.N., di\u00a0Vimercati, S.D.C. (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30\u2013November 3 2006, pp. 288\u2013297. ACM (2006). http:\/\/doi.acm.org\/10.1145\/1180405.1180441"},{"issue":"2","key":"3_CR8","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. Cryptology 25(2), 243\u2013270 (2012). doi: 10.1007\/s00145-010-9094-6","journal-title":"J. Cryptology"},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","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 Sec. Comput. 12(4), 485\u2013490 (2015)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Castiglione, A., De Santis, A., Masucci, B.: Hierarchical and shared key assignment. In: 17th International Conference on Network-Based InformationSystems, NBIS 2014, pp. 263\u2013270. IEEE (2014). http:\/\/dx.doi.org\/10.1109\/NBiS.2014.106","DOI":"10.1109\/NBiS.2014.106"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Castiglione, A., De Santis, A., Masucci, B.: Key indistinguishability vs. strong key indistinguishability for hierarchical key assignment schemes. IEEE Trans. Dependable Sec. Comput. (2015). http:\/\/dx.doi.org\/10.1109\/TDSC.2015.2413415","DOI":"10.1109\/TDSC.2015.2413415"},{"issue":"4","key":"3_CR12","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). doi: 10.1109\/TIFS.2015.2512533","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Castiglione, A., De Santis, A., Masucci, B., et al.: Cryptographic hierarchical access control for dynamic structures. Manuscript Submitted for Publication in IEEE Transactions of Information Forensics and Security (2015)","DOI":"10.1109\/TIFS.2016.2581147"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0167-4048(02)01016-7","volume":"21","author":"T Chen","year":"2002","unstructured":"Chen, T., Chung, Y.: Hierarchical access control based on chinese remainder theorem and symmetric algorithm. Comput. Secur. 21(6), 565\u2013570 (2002). doi: 10.1016\/S0167-4048(02)01016-7","journal-title":"Comput. Secur."},{"issue":"10","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/TKDE.2004.59","volume":"16","author":"H Chien","year":"2004","unstructured":"Chien, H.: Efficient time-bound hierarchical key assignment scheme. IEEE Trans. Knowl. Data Eng. 16(10), 1301\u20131304 (2004). doi: 10.1109\/TKDE.2004.59","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-03816-7_22","volume-title":"Mathematical Foundations of Computer Science 2009","author":"P D\u2019Arco","year":"2009","unstructured":"D\u2019Arco, P., De Santis, A., Ferrara, A.L., Masucci, B.: Security and tradeoffs of the Akl-Taylor scheme and its variants. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 247\u2013257. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03816-7_22"},{"issue":"1","key":"3_CR17","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., Santis, A.D., Ferrara, A.L., Masucci, B.: Variations on a theme by Akl and Taylor: security and tradeoffs. Theor. Comput. Sci. 411(1), 213\u2013227 (2010). doi: 10.1016\/j.tcs.2009.09.028","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ipl.2004.03.019","volume":"92","author":"A Santis De","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)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.ins.2005.07.002","volume":"176","author":"A Santis De","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). doi: 10.1016\/j.ins.2005.07.002","journal-title":"Inf. Sci."},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.dam.2005.03.025","volume":"154","author":"A Santis De","year":"2006","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Unconditionally secure key assignment schemes. Discrete Appl. Math. 154(2), 234\u2013252 (2006). doi: 10.1016\/j.dam.2005.03.025","journal-title":"Discrete Appl. Math."},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-74456-6_34","volume-title":"Mathematical Foundations of Computer Science 2007","author":"A Santis De","year":"2007","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Efficient provably-secure hierarchical key assignment schemes. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 371\u2013382. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74456-6_34"},{"key":"3_CR22","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: New constructions for provably-secure time-bound hierarchical key assignment schemes. In: Lotz, V., Thuraisingham, B.M. (eds.) Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, SACMAT 2007, Sophia Antipolis, France, 20\u201322 June 2007, pp. 133\u2013138. ACM (2007). http:\/\/doi.acm.org\/10.1145\/1266840.1266861"},{"issue":"1\u20133","key":"3_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2008.05.021","volume":"407","author":"A Santis De","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). doi: 10.1016\/j.tcs.2008.05.021","journal-title":"Theor. Comput. Sci."},{"issue":"41","key":"3_CR24","doi-asserted-by":"publisher","first-page":"5684","DOI":"10.1016\/j.tcs.2011.06.024","volume":"412","author":"A Santis De","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). doi: 10.1016\/j.tcs.2011.06.024","journal-title":"Theor. Comput. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-22497-3_19","volume-title":"Information Security and Privacy","author":"ESV Freire","year":"2011","unstructured":"Freire, E.S.V., Paterson, K.G.: Provably secure key assignment schemes from factoring. In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 292\u2013309. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22497-3_19"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Paterson, K.G., Poettering, B.: 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)"},{"issue":"6","key":"3_CR27","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-4048(90)90132-D","volume":"9","author":"L Harn","year":"1990","unstructured":"Harn, L., Lin, H.: A cryptographic key generation scheme for multilevel data security. Comput. Secur. 9(6), 539\u2013546 (1990). doi: 10.1016\/0167-4048(90)90132-D","journal-title":"Comput. Secur."},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0920-5489(03)00073-4","volume":"26","author":"H Huang","year":"2004","unstructured":"Huang, H., Chang, C.: A new cryptographic key assignment scheme with time-constraint access control in a hierarchy. Comput. Stan. Interfaces 26(3), 159\u2013166 (2004). doi: 10.1016\/S0920-5489(03)00073-4","journal-title":"Comput. Stan. Interfaces"},{"issue":"6","key":"3_CR29","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0898-1221(93)90305-F","volume":"25","author":"H Liaw","year":"1993","unstructured":"Liaw, H., Wang, S., Lei, C.: A dynamic cryptographic key assignment scheme in a tree structure. Comput. Math. Appl. 25(6), 109\u2013114 (1993). http:\/\/www.sciencedirect.com\/science\/article\/pii\/089812219390305F","journal-title":"Comput. Math. Appl."},{"issue":"15","key":"3_CR30","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1016\/S0140-3664(97)00100-X","volume":"20","author":"CH Lin","year":"1997","unstructured":"Lin, C.H.: Dynamic key management schemes for access control in a hierarchy. Comput. Commun. 20(15), 1381\u20131385 (1997). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S014036649700100X","journal-title":"Comput. Commun."},{"key":"3_CR31","unstructured":"Lin, I.C., Hwang, M.S., Chang, C.C.: A new key assignment scheme for enforcing complicated access control policies in hierarchy. Future Gener. Comput. Syst. 19(4), pp. 457 \u2013 462 (2003). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X02002005 . Selected Papers from the IEEE\/ACM International Symposium on Cluster Computing and the Grid, Berlin-Brandenburg Academy of Sciences and Humanities, Berlin, Germany, 21\u201324 May 2002"},{"issue":"9","key":"3_CR32","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TC.1985.1676635","volume":"34","author":"SJ MacKinnon","year":"1985","unstructured":"MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. 34(9), 797\u2013802 (1985). doi: 10.1109\/TC.1985.1676635","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0895-7177(97)00120-9","volume":"26","author":"H Min-Shiang","year":"1997","unstructured":"Min-Shiang, H.: A cryptographic key assignment scheme in a hierarchy for access control. Math. Comput. Model. 26(2), 27\u201331 (1997). doi: 10.1016\/S0895-7177(97)00120-9","journal-title":"Math. Comput. Model."},{"issue":"2","key":"3_CR34","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). doi: 10.1016\/0020-0190(88)90099-3","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR35","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/S0167-4048(02)00211-0","volume":"21","author":"VRL Shen","year":"2002","unstructured":"Shen, V.R.L., Chen, T.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Comput. Secur. 21(2), 164\u2013171 (2002). doi: 10.1016\/S0167-4048(02)00211-0","journal-title":"Comput. Secur."},{"issue":"3","key":"3_CR36","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.csi.2004.07.001","volume":"27","author":"Q Tang","year":"2005","unstructured":"Tang, Q., Mitchell, C.J.: Comments on a cryptographic key assignment scheme. Comput. Stan. Interfaces 27(3), 323\u2013326 (2005). doi: 10.1016\/j.csi.2004.07.001","journal-title":"Comput. Stan. Interfaces"},{"issue":"1","key":"3_CR37","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/69.979981","volume":"14","author":"W Tzeng","year":"2002","unstructured":"Tzeng, W.: A time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE Trans. Knowl. Data Eng. 14(1), 182\u2013188 (2002). doi: 10.1109\/69.979981","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR38","unstructured":"Tzeng, W.: A secure system for data access based on anonymous authentication and time-dependent hierarchical keys. In: Lin, F., Lee, D., Lin, B.P., Shieh, S., Jajodia, S. (eds.) Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, Taipei,Taiwan, 21\u201324 March 2006, pp. 223\u2013230. ACM (2006). http:\/\/doi.acm.org\/10.1145\/1128817.1128851"},{"issue":"1","key":"3_CR39","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TDSC.2006.15","volume":"3","author":"S Wang","year":"2006","unstructured":"Wang, S., Laih, C.: Merging: an efficient solution for a time-bound hierarchical key assignment scheme. IEEE Trans. Dependable Sec. Comput. 3(1), 91\u2013100 (2006). doi: 10.1109\/TDSC.2006.15","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"issue":"1","key":"3_CR40","first-page":"25","volume":"16","author":"T Wu","year":"2001","unstructured":"Wu, T., Chang, C.: Cryptographic key assignment scheme for hierarchical access control. Comput. Syst. Sci. Eng. 16(1), 25\u201328 (2001)","journal-title":"Comput. Syst. Sci. Eng."},{"key":"3_CR41","unstructured":"Yeh, J., Chow, R., Newman, R.: A key assignment for enforcing access control policy exceptions. In: Proceedings of the International Symposium on Internet Technology, pp. 54\u201359 (1998)"},{"key":"3_CR42","unstructured":"Yeh, J.: An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription. In: Herzog, O., Schek, H., Fuhr, N., Chowdhury, A., Teiken, W. (eds.) Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen,Germany, 31 October\u20135 November 2005, pp. 285\u2013286. ACM (2005). http:\/\/doi.acm.org\/10.1145\/1099554.1099629"},{"issue":"9","key":"3_CR43","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1109\/TKDE.2005.152","volume":"17","author":"X Yi","year":"2005","unstructured":"Yi, X.: Security of chien\u2019s efficient time-bound hierarchical key assignment scheme. IEEE Trans. Knowl. Data Eng. 17(9), 1298\u20131299 (2005). doi: 10.1109\/TKDE.2005.152","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"3_CR44","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TKDE.2003.1209023","volume":"15","author":"X Yi","year":"2003","unstructured":"Yi, X., Ye, Y.: Security of tzeng\u2019s time-bound key assignment scheme for access control in a hierarchy. IEEE Trans. Knowl. Data Eng. 15(4), 1054\u20131055 (2003). doi: 10.1109\/TKDE.2003.1209023","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40367-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T07:21:58Z","timestamp":1568100118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40367-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319403663","9783319403670"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40367-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}