{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:15Z","timestamp":1725475815399},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677420"},{"type":"electronic","value":"9783540450306"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10718964_26","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:04:09Z","timestamp":1167408249000},"page":"313-327","source":"Crossref","is-referenced-by-count":10,"title":["Light Weight Broadcast Exclusion Using Secret Sharing"],"prefix":"10.1007","author":[{"given":"Natsume","family":"Matsuzaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Anzai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-48000-6_27","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"J. Anzai","year":"1999","unstructured":"Anzai, J., Matsuzaki, N., Matsumoto, T.: A Quick Group Key Distribution Scheme with Entity Revocation. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 333\u2013347. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0304-3975(98)80007-8","volume":"200","author":"C. Blundo","year":"1998","unstructured":"Blundo, C., Fronta Mattos, L.A., Stinson, D.R.: Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. Theoretical Computer Science\u00a0200(1-2), 313\u2013334 (1998)","journal-title":"Theoretical Computer Science"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0053443","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Burmester","year":"1995","unstructured":"Burmester, M., Desmedt, Y.G.: A Secure and Efficient Conference Key Distribution System. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 275\u2013286. Springer, Heidelberg (1995)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast Security: A Taxonomy and Efficient Constructions. In: Proc. INFOCOM 1999, vol.\u00a02, pp. 708\u2013716 (March 1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/3-540-48910-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Malkin, T., Nissim, K.: Efficient Communication-storage Tradeoffs for Multicast Encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 459\u2013474. Springer, Heidelberg (1999)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding Constructions for Blacklisting Problems without Computational Assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BFb0054150","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Luby","year":"1998","unstructured":"Luby, M., Staddon, J.: Combinatorial Bounds for Broadcast Encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 512\u2013526. Springer, Heidelberg (1998)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BFb0053434","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"K. Nyberg","year":"1995","unstructured":"Nyberg, K., Rueppel, R.A.: Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 182\u2013193. Springer, Heidelberg (1995)"},{"issue":"11","key":"26_CR11","first-page":"612","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Comm.Assoc. Comput. Mach.\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm.Assoc. Comput. Mach."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Wallner, D.M., Harder, E.J., Agee, R.C.: Key Management for Multicast: Issues and Architectures, Internet RFC2627 (June 1999), ftp:\/\/ietf.org\/rfc\/rfc2627.txt","DOI":"10.17487\/rfc2627"},{"key":"#cr-split#-26_CR13.1","doi-asserted-by":"crossref","unstructured":"Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. In: Proceedings of ACM SIGCOMM 1998 (1998);","DOI":"10.1145\/285237.285260"},{"key":"#cr-split#-26_CR13.2","unstructured":"Also, Technical Report TR 97-23, Department of Computer Sciences, the University of Texas at Austin (July 1997)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10718964_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:42:08Z","timestamp":1556005328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10718964_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677420","9783540450306"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10718964_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}