{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:14:24Z","timestamp":1784556864336,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T00:00:00Z","timestamp":1290470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00145-010-9094-6","type":"journal-article","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T15:15:17Z","timestamp":1290438917000},"page":"243-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Provably-Secure Time-Bound Hierarchical Key Assignment Schemes"],"prefix":"10.1007","volume":"25","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna Lisa","family":"Ferrara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,23]]},"reference":[{"key":"9094_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A.V. Aho","year":"1972","unstructured":"A.V. Aho, M.R. Garey, J.D. Ullman, The transitive reduction of a directed graph. SIAM J. Comput. 1, 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9094_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"S.G. Akl","year":"1983","unstructured":"S.G. Akl, P.D. Taylor, Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1(3), 239\u2013248 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9094_CR3","unstructured":"M.J. Atallah, M. Blanton, N. Fazio, K.B. Frikken, Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12(3) (2009). Preliminary version in Proc. of the ACM Conference on Computer and Communications Security 2006"},{"key":"9094_CR4","first-page":"11","volume-title":"Proc. of the ACM Symposium on Access Control Models and Technologies","author":"M.J. Atallah","year":"2006","unstructured":"M.J. Atallah, M. Blanton, K.B. Frikken, Key management for non-tree access hierarchies, in Proc. of the ACM Symposium on Access Control Models and Technologies (2006), pp. 11\u201318"},{"key":"9094_CR5","first-page":"515","volume-title":"ESORICS","author":"M.J. Atallah","year":"2007","unstructured":"M.J. Atallah, M. Blanton, K.B. Frikken, Incorporating temporal capabilities in existing key management schemes, in ESORICS (2007), pp. 515\u2013530"},{"key":"9094_CR6","doi-asserted-by":"crossref","unstructured":"G. Ateniese, A. De Santis, A.L. Ferrara, B. Masucci, Provably-secure time-bound hierarchical key assignment schemes. Rep. 2006\/225 at the IACR Cryptology ePrint Archive.","DOI":"10.1145\/1180405.1180441"},{"key":"9094_CR7","first-page":"288","volume-title":"Proc. of the ACM Conference on Computer and Communications Security","author":"G. Ateniese","year":"2006","unstructured":"G. Ateniese, A. De Santis, A.L. Ferrara, B. Masucci, Provably-secure time-bound hierarchical key assignment schemes, in Proc. of the ACM Conference on Computer and Communications Security (2006), pp. 288\u2013297"},{"key":"9094_CR8","unstructured":"M. Bellare, P. Rogaway, Introduction to modern cryptography. Available as http:\/\/www.cs.ucdavis.edu\/~rogaway\/classes\/227\/fall03\/book\/index.html"},{"key":"9094_CR9","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proc. of Advances in Cryptology, Crypto","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, Keying hash functions for message authentication, in Proc. of Advances in Cryptology, Crypto. Lecture Notes in Computer Science (1996), pp. 1\u201315"},{"key":"9094_CR10","first-page":"394","volume-title":"Proc. of the 38th IEEE Symposium on Foundations of Computer Science","author":"M. Bellare","year":"1997","unstructured":"M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A concrete security treatment of symmetric encryption, in Proc. of the 38th IEEE Symposium on Foundations of Computer Science (1997), pp. 394\u2013403"},{"key":"9094_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/586110.586116","volume-title":"Proc. of the ACM Conference on Computer and Communications Security","author":"E. Bertino","year":"2002","unstructured":"E. Bertino, B. Carminati, E. Ferrari, A temporal key management scheme for secure broadcasting of XML documents, in Proc. of the ACM Conference on Computer and Communications Security (2002), pp. 31\u201340"},{"key":"9094_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology\u2014Eurocrypt","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, X. Boyen, Efficient selective-ID secure identity-based encryption without random oracles, in Advances in Cryptology\u2014Eurocrypt. Lecture Notes in Computer Science (2004), pp. 223\u2013238"},{"key":"9094_CR13","first-page":"440","volume-title":"EUROCRYPT","author":"D. Boneh","year":"2005","unstructured":"D. Boneh, X. Boyen, E.-J. Goh, Hierarchical identity based encryption with constant size ciphertext, in EUROCRYPT (2005), pp. 440\u2013456"},{"issue":"3","key":"9094_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9094_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"9094_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Proc. of Advances in Cryptology\u2014Eurocrypt","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in Proc. of Advances in Cryptology\u2014Eurocrypt. Lecture Notes in Computer Science, vol. 2656 (2003), pp. 255\u2013271"},{"issue":"6","key":"9094_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0167-4048(02)01016-7","volume":"21","author":"T. Chen","year":"2002","unstructured":"T. Chen, Y. Chung, Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Comput. Secur. 21(6), 565\u2013570 (2002)","journal-title":"Comput. Secur."},{"issue":"10","key":"9094_CR18","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/TKDE.2004.59","volume":"16","author":"H.-Y. Chien","year":"2004","unstructured":"H.-Y. Chien, Efficient time-bound hierarchical key assignment scheme. IEEE Trans. Knowl. Data Eng. 16(10), 1301\u20131304 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9094_CR19","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/CSFW.2006.20","volume-title":"Proc. of the 19th IEEE Computer Security Foundations Workshop","author":"J. Crampton","year":"2006","unstructured":"J. Crampton, K. Martin, P. Wild, On key assignment for hierarchical access control, in Proc. of the 19th IEEE Computer Security Foundations Workshop (2006), pp. 98\u2013111"},{"issue":"1","key":"9094_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2009.09.028","volume":"411","author":"P. D\u2019Arco","year":"2010","unstructured":"P. D\u2019Arco, A. De Santis, A.L. Ferrara, B. Masucci, Variations on a theme by Akl and Taylor: security and tradeoffs. Theor. Comput. Sci. 411(1), 213\u2013227 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9094_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2004.03.019","volume":"92","author":"A. Santis De","year":"2004","unstructured":"A. De Santis, A.L. Ferrara, B. Masucci, 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":"9094_CR22","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.ins.2005.07.002","volume":"176","author":"A. Santis De","year":"2006","unstructured":"A. De Santis, A.L. Ferrara, B. Masucci, Enforcing the security of a time-bound hierarchical key assignment scheme. Inf. Sci. 176(12), 1684\u20131694 (2006)","journal-title":"Inf. Sci."},{"key":"9094_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-74456-6_34","volume-title":"MFCS","author":"A. Santis De","year":"2007","unstructured":"A. De Santis, A.L. Ferrara, B. Masucci, Efficient provably-secure hierarchical key assignment schemes, in MFCS, ed. by L. Kucera, A. Kucera. Lecture Notes in Computer Science, vol. 4708 (Springer, Berlin, 2007), pp. 371\u2013382"},{"issue":"1\u20133","key":"9094_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2008.05.021","volume":"407","author":"A. Santis De","year":"2008","unstructured":"A. De Santis, A.L. Ferrara, B. Masucci, 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":"9094_CR25","series-title":"Lecture Notes in Computer Science","first-page":"385","volume-title":"Proc. of the Algorithmic Number Theory Symposium","author":"S.D. Galbraith","year":"2000","unstructured":"S.D. Galbraith, K. Harrison, D. Soldera, Implementing the tate pairing, in Proc. of the Algorithmic Number Theory Symposium. Lecture Notes in Computer Science (2000), pp. 385\u2013394"},{"issue":"4","key":"9094_CR26","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"9094_CR27","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9094_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9094_CR29","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-4048(90)90132-D","volume":"9","author":"L. Harn","year":"1990","unstructured":"L. Harn, H.Y. Lin, A cryptographic key generation scheme for multilevel data security. Comput. Secur. 9(6), 539\u2013546 (1990)","journal-title":"Comput. Secur."},{"key":"9094_CR30","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0920-5489(03)00073-4","volume":"26","author":"H.F. Huang","year":"2004","unstructured":"H.F. Huang, C.C. Chang, A new cryptographic key assignment scheme with time-constraint access control in a hierarchy. Comput. Stand. Interfaces 26, 159\u2013166 (2004)","journal-title":"Comput. Stand. Interfaces"},{"issue":"1","key":"9094_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0895-7177(97)00197-0","volume":"26","author":"M.S. Hwang","year":"1997","unstructured":"M.S. Hwang, A cryptographic key assignment scheme in a hierarchy for access control. Math. Comput. Model. 26(1), 27\u201331 (1997)","journal-title":"Math. Comput. Model."},{"key":"9094_CR32","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Proc. of the Algorithmic Number Theory Symposium","author":"A. Joux","year":"2000","unstructured":"A. Joux, A one round protocol for tripartite Diffie-Hellman, in Proc. of the Algorithmic Number Theory Symposium (2000), pp. 385\u2013394"},{"issue":"1","key":"9094_CR33","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00145-005-0310-8","volume":"19","author":"J. Katz","year":"2006","unstructured":"J. Katz, M. Yung, Characterization of security notions for probabilistic private-key encryption. J. Cryptol. 19(1), 67\u201395 (2006)","journal-title":"J. Cryptol."},{"issue":"6","key":"9094_CR34","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0898-1221(93)90305-F","volume":"25","author":"H.T. Liaw","year":"1993","unstructured":"H.T. Liaw, S.J. Wang, C.L. Lei, A dynamic cryptographic key assignment scheme in a tree structure. Comput. Math. Appl. 25(6), 109\u2013114 (1993)","journal-title":"Comput. Math. Appl."},{"key":"9094_CR35","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/S0140-3664(97)00100-X","volume":"20","author":"C.H. Lin","year":"1997","unstructured":"C.H. Lin, Dynamic key management schemes for access control in a hierarchy. Comput. Commun. 20, 1381\u20131385 (1997)","journal-title":"Comput. Commun."},{"key":"9094_CR36","first-page":"157","volume":"19","author":"I.C. Lin","year":"2003","unstructured":"I.C. Lin, M.S. Hwang, C.C. Chang, A new key assignment scheme for enforcing complicated access control policies in hierarchy. Future Gener. Comput. Syst. 19, 157\u2013462 (2003)","journal-title":"Future Gener. Comput. Syst."},{"issue":"9","key":"9094_CR37","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TC.1985.1676635","volume":"34","author":"S.J. MacKinnon","year":"1985","unstructured":"S.J. MacKinnon, P.D. Taylor, H. Meijer, S.G. Akl, An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. 34(9), 797\u2013802 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"9094_CR38","doi-asserted-by":"crossref","unstructured":"A. Miyaji, M. Nakabayashi, S. Takano, New explicit conditions for elliptic curve traces for FR-reduction. IEICE Trans. Fundam. E-84(5) (2001)","DOI":"10.1007\/3-540-45247-8_8"},{"issue":"2","key":"9094_CR39","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"M. Naor, O. Reingold, Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"9094_CR40","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(88)90099-3","volume":"27","author":"R.S. Sandhu","year":"1988","unstructured":"R.S. Sandhu, Cryptographic implementation of a tree hierarchy for access control. Inf. Process. Lett. 27(2), 95\u201398 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9094_CR41","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/S0167-4048(02)00211-0","volume":"21","author":"V. Shen","year":"2002","unstructured":"V. Shen, T. Chen, A novel key management scheme based on discrete logarithms and polynomial interpolations. Comput. Secur. 21(2), 164\u2013171 (2002)","journal-title":"Comput. Secur."},{"key":"9094_CR42","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.csi.2004.07.001","volume":"27","author":"Q. Tang","year":"2005","unstructured":"Q. Tang, C.J. Mitchell, Comments on a cryptographic key assignment scheme. Comput. Stand. Interfaces 27, 323\u2013326 (2005)","journal-title":"Comput. Stand. Interfaces"},{"issue":"1","key":"9094_CR43","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/69.979981","volume":"14","author":"W.-G. Tzeng","year":"2002","unstructured":"W.-G. Tzeng, A time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE Trans. Knowl. Data Eng. 14(1), 182\u2013188 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9094_CR44","first-page":"223","volume-title":"Proc. of the ACM Symposium on Information, Computer and Communications Security","author":"W.-G. Tzeng","year":"2006","unstructured":"W.-G. Tzeng, A secure system for data access based on anonymous and time-dependent hierarchical keys, in Proc. of the ACM Symposium on Information, Computer and Communications Security (2006), pp. 223\u2013230"},{"issue":"1","key":"9094_CR45","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TDSC.2006.15","volume":"3","author":"S.-Y. Wang","year":"2006","unstructured":"S.-Y. Wang, C.- Laih, Merging: an efficient solution for a time-bound hierarchical key assignment scheme. IEEE Trans. Dependable Secure Comput. 3(1), 91\u2013100 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"9094_CR46","first-page":"25","volume":"1","author":"T. Wu","year":"2001","unstructured":"T. Wu, C. Chang, Cryptographic key assignment scheme for hierarchical access control. Int. J. Comput. Syst. Sci. Eng. 1(1), 25\u201328 (2001)","journal-title":"Int. J. Comput. Syst. Sci. Eng."},{"key":"9094_CR47","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/1099554.1099629","volume-title":"Proc. of the ACM CIKM International Conference on Information and Knowledge Management","author":"J. Yeh","year":"2005","unstructured":"J. Yeh, An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription, in Proc. of the ACM CIKM International Conference on Information and Knowledge Management (2005), pp. 285\u2013286"},{"key":"9094_CR48","first-page":"54","volume-title":"Proc. of the International Symposium on Internet Technology","author":"J. Yeh","year":"1998","unstructured":"J. Yeh, R. Chow, R. Newman, A key assignment for enforcing access control policy exceptions, in Proc. of the International Symposium on Internet Technology (1998), pp. 54\u201359"},{"issue":"9","key":"9094_CR49","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1109\/TKDE.2005.152","volume":"17","author":"X. Yi","year":"2005","unstructured":"X. Yi, Security of chien\u2019s efficient time-bound hierarchical key assignment scheme. IEEE Trans. Knowl. Data Eng. 17(9), 1298\u20131299 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"9094_CR50","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TKDE.2003.1209023","volume":"15","author":"X. Yi","year":"2003","unstructured":"X. Yi, Y. Ye, 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)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9094-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9094-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9094-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9094-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T23:29:35Z","timestamp":1636846175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9094-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,23]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9094"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9094-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,23]]},"assertion":[{"value":"23 October 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}