{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:51Z","timestamp":1725536811536},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_22","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"247-257","source":"Crossref","is-referenced-by-count":7,"title":["Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Arco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna Lisa","family":"Ferrara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"22_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":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-36178-2_27","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"T. Asano","year":"2002","unstructured":"Asano, T.: A Revocation Scheme with Minimal Storage at Receivers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 433\u2013450. Springer, Heidelberg (2002)"},{"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., Article 18??12(3) (2009);","key":"#cr-split#-22_CR3.1","DOI":"10.1145\/1455526.1455531"},{"unstructured":"Prelim. version in Proc. of ACM CCS 2005, pp. 190???201 (2005)","key":"#cr-split#-22_CR3.2"},{"doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. Rep. 2006\/225 at the IACR Cryptology ePrint Archive. Prelim. version in Proc. of ACM CCS 2006, pp. 288\u2013297 (2006)","key":"22_CR4","DOI":"10.1145\/1180405.1180441"},{"doi-asserted-by":"crossref","unstructured":"Attrapadung, N., Kobara, K.: Broadcast Encryption with Short Keys and Transmissions. In: Proc. of the 3rd ACM workshop on Digital Rights Management, pp. 55\u201366 (2003)","key":"22_CR5","DOI":"10.1145\/947380.947388"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","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. Proc. Lett.\u00a092(4), 199\u2013205 (2004)","journal-title":"Inf. Proc. Lett."},{"key":"22_CR7","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)"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A Hard-Core Predicate for All One-Way Functions. In: Proc. of ACM STOC 1989, pp. 25\u201332 (1989)","key":"22_CR8","DOI":"10.1145\/73007.73010"},{"key":"22_CR9","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 Comput. and Syst. Sci.\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Comput. and Syst. Sci."},{"issue":"6","key":"22_CR10","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. Comput. and Security\u00a09(6), 539\u2013546 (1990)","journal-title":"Comput. and Security"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.csi.2003.11.010","volume":"26","author":"I.-C. Lin","year":"2004","unstructured":"Lin, I.-C., Oub, H.-H., Hwang, M.-S.: Efficient Access Control and Key Management Schemes for Mobile Agents. Comput. Standards & Interfaces\u00a026(5), 423\u2013433 (2004)","journal-title":"Comput. Standards & Interfaces"},{"doi-asserted-by":"crossref","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. on Computers, C-34(9), 797\u2013802 (1985)","key":"22_CR12","DOI":"10.1109\/TC.1985.1676635"},{"unstructured":"Rabin, M.O.: Digitalized Signatures and Public Key Functions as Intractable as Factorization, Tech. Rep. MIT\/LCS\/TR-212, MIT Lab. for Computer Science (1979)","key":"22_CR13"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communic. ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communic. ACM"},{"doi-asserted-by":"crossref","unstructured":"Tzeng, W.-G.: A Secure System for Data Access Based on Anonymous and Time-Dependent Hierarchical Keys. In: Proc. of ACM ASIACCS 2006, pp. 223\u2013230 (2006)","key":"22_CR15","DOI":"10.1145\/1128817.1128851"},{"unstructured":"Yeh, J.H., Chow, R., Newman, R.: A Key Assignment for Enforcing Access Control Policy Exceptions. In: Proc. of Int. Symposium on Internet Technology, pp. 54\u201359 (1998)","key":"22_CR16"},{"doi-asserted-by":"crossref","unstructured":"Wang, S.-Y., Laih, C.-S.: Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme. IEEE Trans. on Dependable and Secure Computing\u00a03(1) (2006)","key":"22_CR17","DOI":"10.1109\/TDSC.2006.15"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:33:50Z","timestamp":1558492430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}