{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:14:34Z","timestamp":1784556874380,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642360947","type":"print"},{"value":"9783642360954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36095-4_7","type":"book-chapter","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T10:56:11Z","timestamp":1360580171000},"page":"101-114","source":"Crossref","is-referenced-by-count":26,"title":["Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes"],"prefix":"10.1007","author":[{"given":"Eduarda S. V.","family":"Freire","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenneth G.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertram","family":"Poettering","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"S.G. Akl","year":"1983","unstructured":"Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems\u00a01(3), 239\u2013248 (1983)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"9","key":"7_CR2","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TC.1985.1676635","volume":"34","author":"S.J. 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 Transactions on Computers\u00a034(9), 797\u2013802 (1985)","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"7_CR3","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.Y.: A cryptographic key generation scheme for multilevel data security. Computers & Security\u00a09(6), 539\u2013546 (1990)","journal-title":"Computers & Security"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0167-4048(02)01016-7","volume":"21","author":"T.S. Chen","year":"2002","unstructured":"Chen, T.S., Chung, Y.F.: Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Computers & Security\u00a021(6), 565\u2013570 (2002)","journal-title":"Computers & Security"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/S0167-4048(02)00211-0","volume":"21","author":"V. Shen","year":"2002","unstructured":"Shen, V., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security\u00a021(2), 164\u2013171 (2002)","journal-title":"Computers & Security"},{"issue":"1","key":"7_CR6","first-page":"25","volume":"16","author":"T.C. Wu","year":"2001","unstructured":"Wu, T.C., Chang, C.C.: Cryptographic key assignment scheme for hierarchical access control. Int. Journal of Computer Systems Science and Engineering\u00a016(1), 25\u201328 (2001)","journal-title":"Int. Journal of Computer Systems Science and Engineering"},{"key":"7_CR7","unstructured":"Yeh, J.H., Chow, R., Newman, R.: A key assignment for enforcing access control policy exceptions. In: Int. Symposium on Internet Technology, pp. 54\u201359 (1998)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190\u2013202 (2006)","DOI":"10.1145\/1102120.1102147"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: ACM Conference on Computer and Communications Security, pp. 288\u2013297 (2006)","DOI":"10.1145\/1180405.1180441"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Tzeng, W.G.: A secure system for data access based on anonymous authentication and time-dependent hierarchical keys. In: ACM Symposium on Information, Computer and Communications Security, pp. 223\u2013230 (2006)","DOI":"10.1145\/1128817.1128851"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TDSC.2006.15","volume":"3","author":"S.Y. Wang","year":"2006","unstructured":"Wang, S.Y., Laih, C.S.: An efficient solution for a time-bound hierarchical key assignment scheme. IEEE Transactions on Dependable and Secure Computing\u00a03(1), 91\u2013100 (2006)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"7_CR12","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.\u00a04708, pp. 371\u2013382. Springer, Heidelberg (2007)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur.\u00a012(3) (2009)","DOI":"10.1145\/1455526.1455531"},{"issue":"1","key":"7_CR14","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. Theoretical Computer Science\u00a0411(1), 213\u2013227 (2010)","journal-title":"Theoretical Computer Science"},{"key":"7_CR15","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":"J. Crampton","year":"2010","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. LNCS, vol.\u00a06166, pp. 130\u2013145. Springer, Heidelberg (2010)"},{"key":"7_CR16","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":"E.S.V. 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.\u00a06812, pp. 292\u2013309. Springer, Heidelberg (2011)"},{"issue":"2","key":"7_CR17","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\u00a025(2), 243\u2013270 (2012)","journal-title":"J. Cryptology"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: Computer Security Foundations Workshop, pp. 98\u2013111 (2006)","DOI":"10.1109\/CSFW.2006.20"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M. Blum","year":"1985","unstructured":"Blum, M., Goldwasser, S.: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 289\u2013299. Springer, Heidelberg (1985)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36563-X_1","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Yee, B.S.: Forward-Security in Private-Key Cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 1\u201318. Springer, Heidelberg (2003)"},{"key":"7_CR24","unstructured":"Freire, E.S.V., Paterson, K.G., Poettering, B.: Simple, efficient and strongly KI-secure hierarchical key assignment schemes (2012), http:\/\/eprint.iacr.org\/2012\/645"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051(1), 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-28628-8_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Gennaro, R., H\u00e5stad, J., Krawczyk, H., Rabin, T.: Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 494\u2013510. Springer, Heidelberg (2004)"},{"issue":"4","key":"7_CR27","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36095-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T20:34:31Z","timestamp":1745958871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36095-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360947","9783642360954"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36095-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}