{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T01:40:11Z","timestamp":1739410811172,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102295"},{"type":"electronic","value":"9783642102301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10230-1_4","type":"book-chapter","created":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T12:41:06Z","timestamp":1256992866000},"page":"46-64","source":"Crossref","is-referenced-by-count":1,"title":["Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Arco","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"4_CR1","doi-asserted-by":"publisher","first-page":"4380","DOI":"10.1109\/TIT.2006.881728","volume":"52","author":"M. Baer","year":"2006","unstructured":"Baer, M.: Source coding for campbell\u2019s penalties. IEEE Transactions on Information Theory\u00a052(10), 4380\u20134393 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-46416-6_50","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"S. Berkovits","year":"1991","unstructured":"Berkovits, S.: How to broadcast a secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 535\u2013541. Springer, Heidelberg (1991)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00537132","volume":"6","author":"L.L. Campbell","year":"1966","unstructured":"Campbell, L.L.: Definition of entropy by means of a coding problem. Zeitschrift fur Wahrscheinlichkeitstheorie und wandte Gebiete\u00a06, 113\u2013118 (1966)","journal-title":"Zeitschrift fur Wahrscheinlichkeitstheorie und wandte Gebiete"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure internet multicast using boolean function minimization techniques. In: Proceedings of IEEE INFOCOMM 1999, vol.\u00a02, pp. 689\u2013698 (1999)","DOI":"10.1109\/INFCOM.1999.751455"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Proceedings of INFOCOMM 1999, pp. 708\u2013716 (1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"4_CR6","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":"4_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Caronni, G., Waldvogel, M., Sun, D., Plattner, B.: Efficient security for large and dynamic multicast groups. In: IEEE 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 1998) (1998)","DOI":"10.1109\/ENABL.1998.725721"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Erdos, P., Frankl, P., Furedi, Z.: Families of finite subsets in which no set is covered by the union of r others. Israel Journal of Mathematics\u00a0(51), 75\u201389 (1985)","DOI":"10.1007\/BF02772959"},{"key":"4_CR10","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":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/978-3-540-28628-8_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M.T. Goodrich","year":"2004","unstructured":"Goodrich, M.T., Sun, J.Z., Tamassia, R.: Efficient tree-based revocation in groups of low-state devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 511\u2013527. Springer, Heidelberg (2004)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11889663_23","volume-title":"Financial Cryptography and Data Security","author":"Y.H. Hwang","year":"2006","unstructured":"Hwang, Y.H., Lee, P.J.: Efficient broadcast encryption scheme with log-key storage. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 281\u2013295. Springer, Heidelberg (2006)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/11535218_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.Y. Hwang","year":"2005","unstructured":"Hwang, J.Y., Lee, D.H., Lim, J.: Generic transformation for scalable broadcast encryption schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 276\u2013292. Springer, Heidelberg (2005)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45708-9_4","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Halevy","year":"2002","unstructured":"Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 47\u201360. Springer, Heidelberg (2002)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/11426639_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"N. Jho","year":"2005","unstructured":"Jho, N., Hwang, J.Y., Cheon, J.H., Kim, M., Lee, D.H., Yoo, E.S.: One-way chain based broadcast encryption schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 559\u2013574. Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1145\/79147.79150","volume":"37","author":"L.L. Larmore","year":"1990","unstructured":"Larmore, L.L., Hirschberg, D.S.: A fast algorithm for optimal length-limited Huffman codes. Journal of Association for Computing Machinery\u00a037(2), 464\u2013473 (1990)","journal-title":"Journal of Association for Computing Machinery"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-540-24676-3_10","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Panjwani, S.: Optimal communication complexity of generic multicast key distribution. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 153\u2013170. Springer, Heidelberg (2004)"},{"key":"4_CR18","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), Full version, http:\/\/www.wisdom.weizmann.ac.il\/~naor\/"},{"issue":"7","key":"4_CR19","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/18.959263","volume":"47","author":"R. Poovendran","year":"2001","unstructured":"Poovendran, R., Baras, J.S.: An information theoretic analysis of rooted-tree based secure multicast key distribution schemes. IEEE Transactions on Information Theory\u00a047(7), 2824\u20132834 (2001); Preliminary version In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 624. Springer, Heidelberg (1999)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"4_CR20","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TSE.2003.1199073","volume":"29","author":"A.T. Sherman","year":"2003","unstructured":"Sherman, A.T., McGrew, D.A.: Key establishment in large dynamic groups using one-way function trees. IEEE Transactions on Software Engineering\u00a029(5), 444\u2013458 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: Proceedings of IEEE INFOCOMM 2001, pp. 422\u2013431 (2001)","DOI":"10.1109\/INFCOM.2001.916725"},{"key":"4_CR22","volume-title":"Proceedings ACM SIGCOMM 1998","author":"C. Wong","year":"1998","unstructured":"Wong, C., Gouda, M., Lam, S.: Secure group communications using key graphs. In: Proceedings ACM SIGCOMM 1998. ACM, New York (1998)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Wallner, D., Hardler, E., Agee, R.: Key management for multicast: Issues and architectures. RFC 2627, National Security Agency (June 1999)","DOI":"10.17487\/rfc2627"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10230-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T01:05:00Z","timestamp":1739408700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10230-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102295","9783642102301"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10230-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}