{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:33:58Z","timestamp":1725543238360},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540366461"},{"type":"electronic","value":"9783540378631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11801412_9","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:29:50Z","timestamp":1154546990000},"page":"96-109","source":"Crossref","is-referenced-by-count":3,"title":["Anonymous Distribution of Encryption Keys in Cellular Broadcast Systems"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Cicho\u0144","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Krzywiecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Wla\u017a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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 \u201cEntity Revocation\u201d. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 333\u2013347. Springer, Heidelberg (1999)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced Allocations. SIAM J. Comput.\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced Allocations: The Heavily Loaded Case. In: 32nd ACM-STOC, Portland, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-49543-6_12","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"R. Cole","year":"1998","unstructured":"Cole, R., Frieze, A., Maggs, B.M., Mitzenmacher, M., Richa, A.W., Sitaraman, R.K., Upfal, E.: On Balls and Bins with Deletions. In: Rolim, J.D.P., Serna, M.J., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 145\u2013158. Springer, Heidelberg (1998)"},{"key":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-31815-6_22","volume-title":"Information Security Applications","author":"C.H. Kim","year":"2005","unstructured":"Kim, C.H., Hwang, Y.H., Lee, P.J.: Practical Pay-TV Scheme using Traitor Tracing Scheme for Multiple Channels. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 264\u2013277. Springer, Heidelberg (2005)"},{"key":"9_CR7","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":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and Tracing Schemes for Stateless Receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 41\u201362. Springer, Heidelberg (2001)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","volume-title":"Financial Cryptography","author":"M. Naor","year":"2001","unstructured":"Naor, M., Pinkas, B.: Efficient Trace and Revoke Schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 1\u201320. Springer, Heidelberg (2001)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/10718964_26","volume-title":"Information Security and Privacy","author":"N. Matsuzaki","year":"2000","unstructured":"Matsuzaki, N., Anzai, J., Matsumoto, T.: Light Weight Broadcast Exclusion using Secret Sharing. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol.\u00a01841, pp. 313\u2013327. Springer, Heidelberg (2000)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Prabhakar, B., Shah, D.: Load Balancing with Memory. In: 43rd IEEE FOCS, pp. 799\u2013808 (2002)","DOI":"10.1109\/SFCS.2002.1182005"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: Randomized Initialization Protocols for Radio Networks. In: ch.9 [15]","DOI":"10.1002\/0471224561.ch9"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M. Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \"Balls into bins\" - A simple and tight analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., Suri, S., Varghese, G.: A Lower Bound for Multicast Key Distribution. In: Proc. of IEEE INFOCOM 2001, Anchorage, pp. 422\u2013431 (2001)","DOI":"10.1109\/INFCOM.2001.916725"},{"volume-title":"Handbook of Wireless Networks and Mobile Computing","year":"2002","key":"9_CR15","unstructured":"Stojmenovi\u0107, I. (ed.): Handbook of Wireless Networks and Mobile Computing. Wiley, Chichester (2002)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How Asymmetry Helps Load Balancing. In: 40th IEEE-FOCS, pp. 131\u2013140 (1999)","DOI":"10.1109\/SFFCS.1999.814585"},{"key":"9_CR17","unstructured":"V\u00f6cking, B.: Symmetric vs. Asymmetric Multiple-Choice Algorithms. In: Proc. 2nd ARACNE Workshop, Aarhus, pp. 7\u201315 (2001)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. RFC 2627 (June 1999)","DOI":"10.17487\/rfc2627"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-39650-5_5","volume-title":"Computer Security \u2013 ESORICS 2003","author":"Y. Watanabe","year":"2003","unstructured":"Watanabe, Y., Numao, M.: Multi-round Secure Light-Weight Broadcast Exclusion Protocol with Pre-processing. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 85\u201399. Springer, Heidelberg (2003)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Wong, C.K., Goudaand, M., Lam, S.: Secure Group Communications Using Key Graphs. In: ACM SIGCOMM 1998, pp. 68\u201379 (1998)","DOI":"10.1145\/285237.285260"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Xu, J., Lee, D.-L., Hu, Q., Lee, W.-C.: Data Broadcast. In: ch. 10 in [15]","DOI":"10.1002\/0471224561.ch11"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.comnet.2003.12.012","volume":"44","author":"X.B. Zhang","year":"2004","unstructured":"Zhang, X.B., Lam, S.S., Lee, D.-Y.: Group Rekeying with Limited Unicast Recovery. Computer Networks\u00a044(6), 855\u2013870 (2004)","journal-title":"Computer Networks"}],"container-title":["Lecture Notes in Computer Science","Secure Mobile Ad-hoc Networks and Sensors"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11801412_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:30Z","timestamp":1605643890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11801412_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366461","9783540378631"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11801412_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}