{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:40:21Z","timestamp":1737369621285,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74456-6_34","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"371-382","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Provably-Secure Hierarchical Key Assignment Schemes"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[]},{"given":"Anna Lisa","family":"Ferrara","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"34_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 Trans. on Comput. Syst.\u00a01(3), 239\u2013248 (1983)","journal-title":"ACM Trans. on Comput. Syst."},{"key":"34_CR2","unstructured":"Alon, N., Schieber, B.: Optimal Preprocessing for Answering On-line Product Queries, Tech. Rep, TR 71\/87, Inst. of Comput. Sci., Tel-Aviv Univ. (1987)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Frikken, K.B., Blanton, M.: Dynamic and Efficient Key Management for Access Hierarchies. In: Proc. of ACM CCS\u00a02005, pp. 190\u2013201(2005)","DOI":"10.1145\/1102120.1102147"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and Efficient Key Management for Access Hierarchies, CERIAS Tech. Rep. TR 2006-09, Purdue Univ. (2006)","DOI":"10.1145\/1133058.1133062"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Blanton, M., Frikken, K.B.: Key Management for Non-Tree Access Hierarchies. In: Proc. of ACM SACMAT 2006, pp. 11\u201318 (2006), Full version avail at http:\/\/www.cs.purdue.edu\/homes\/mbykova\/papers\/key-derivation.pdf","DOI":"10.1145\/1133058.1133062"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. In: Proc. of ACM CCS 2006, pp. 288\u2013297. Full version avail. as Rep. 2006\/225 at the IACR Cryptology ePrint Archive (2006)","DOI":"10.1145\/1180405.1180441"},{"key":"34_CR7","first-page":"111","volume":"1","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L., Tel, G., Santoro, N.: Trade-offs in Non-reversing Diameter. Nordic J. on Comput.\u00a01, 111\u2013134 (1994)","journal-title":"Nordic J. on Comput."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B.: Computing on a Free Tree via Complexity-Preserving Mappings. Algorithmica\u00a02, 337\u2013361 (1987)","journal-title":"Algorithmica"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Crampton, J., Martin, K., Wild, P.: On Key Assignment for Hierarchical Access Control. In: Proc. of IEEE CSFW, pp. 98\u2013111 (2006)","DOI":"10.1109\/CSFW.2006.20"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"De Santis, A., Ferrara, A.L., Masucci, B.: Efficient Provably-Secure Hierarchical Key Assignment Schemes, avail. as Rep. 2006\/479 at the IACR Cryptology ePrint Archive (2006)","DOI":"10.1007\/978-3-540-74456-6_34"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially Ordered Sets. American Journal of Mathematics\u00a063, 600\u2013610 (1941)","journal-title":"American Journal of Mathematics"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Comp. and System Sci.\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Comp. and System Sci."},{"key":"34_CR14","unstructured":"Hesse, W.: Directed Graphs Requiring Large Number of Shortcuts. In: Proc. of ACM-SIAM SODA 2003, pp. 665\u2013669 (2003)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-56402-0_48","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Thorup","year":"1993","unstructured":"Thorup, M.: On Shortcutting Digraphs. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 205\u2013211. Springer, Heidelberg (1993)"},{"key":"34_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0963548300001668","volume":"4","author":"M. Thorup","year":"1995","unstructured":"Thorup, M.: Shortcutting Planar Digraphs. Combinatorics, Probability & Comput.\u00a04, 287\u2013315 (1995)","journal-title":"Combinatorics, Probability & Comput."},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Space-Time Tradeoff for Answering Range Queries. In: Proc. of ACM STOC 1982, pp. 128\u2013136 (1982)","DOI":"10.1145\/800070.802185"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:36:22Z","timestamp":1737365782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744559","9783540744566"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}