{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:47Z","timestamp":1725494207829},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008477"},{"type":"electronic","value":"9783540365631"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36563-x_18","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T10:24:59Z","timestamp":1193999099000},"page":"263-280","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fault Tolerant and Distributed Broadcast Encryption"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Arco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, John Wiley, (2nd Edition), 2000. 272","DOI":"10.1002\/0471722154"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-540-48000-6_27","volume-title":"Advances in Cryptology-Asiacrypt\u2019 99","author":"J. Anzai","year":"1999","unstructured":"J. Anzai, N. Matsuzaki, and T. Matsumoto, A Quick Group Key Distribution Scheme with Entity Revocation, Advances in Cryptology-Asiacrypt\u2019 99, Lecture Notes in Computer Science, Vol. 1716, pp. 333\u2013347. 266"},{"key":"18_CR3","unstructured":"O. Berkman, M. Parnas, and J. Sgall, Efficient Dynamic Traitor Tracing, Proc. of the 11-th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 586\u2013595, 2000. 266"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","first-page":"536","volume-title":"Advances in Cryptology-Eurocrypt\u2019 91","author":"S. Berkovits","year":"1991","unstructured":"S. Berkovits, How to Broadcast a Secret, Advances in Cryptology-Eurocrypt\u2019 91, Lecture Notes in Computer Science, vol. 547, pp. 536\u2013541, 1991. 266"},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BFb0053444","volume-title":"Advances in Cryptology-Eurocrypt\u2019 94","author":"C. Blundo","year":"1995","unstructured":"C. Blundo and A. Cresti, Space Requirements for Broadcast Encryption, Advances in Cryptology-Eurocrypt\u2019 94, Lecture Notes in Computer Science, vol. 950, pp. 287\u2013298, 1995. 266"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0304-3975(98)80007-8","volume":"200","author":"C. Blundo","year":"1998","unstructured":"C. Blundo, Luiz A. Frota Mattos, and D. R. Stinson, Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution, Theoretical Computer Science, vol. 200, pp. 313\u2013334, 1998. 266","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","first-page":"242","volume-title":"Advances in Cryptology-Crypto\u2019 84","author":"G. R. Blakley","year":"1984","unstructured":"G. R. Blakley and C. Meadows, Security of Ramp Schemes, Advances in Cryptology-Crypto\u2019 84, Lecture Notes in Computer Science, vol.196, pp. 242\u2013268, 1984. 280"},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology-Crypto\u2019 99","author":"D. Boneh","year":"1999","unstructured":"D. Boneh and M. Franklin, An Efficient Public Key Traitor Scheme, Advances in Cryptology-Crypto\u2019 99, Lecture Notes in Computer Science, vol. 1666, pp. 338\u2013353, 1999. 266"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, Issue in Multicast Security: A Taxonomy and Efficient Constructions, Infocom\u2019 99, pp. 708\u2013716, 1999. 266","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"18_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/3-540-48910-X_32","volume-title":"Advances in Cryptology-Eurocrypt\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti, T. Malkin, and K. Nissim, Efficient Communication-Storage Tradeoffs for Multicast Encryption, Advances in Cryptology-Eurocrypt\u2019 99, Lecture Notes in Computer Science, vol. 1592, pp. 459\u2013474, 1999. 266"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B. Chor","year":"2000","unstructured":"B. Chor, A. Fiat, M. Naor and B. Pinkas, Traitor Tracing, IEEE Transactions on Information Theory, vol. 46, No. 3, pp. 893\u2013910, May 2000. 266","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991. 280","DOI":"10.1002\/0471200611"},{"key":"18_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Security in Communication Network (SCN02)","author":"G. Crescenzo Di","year":"2002","unstructured":"G. Di Crescenzo and O. Kornievskaia, Efficient Multicast Encryption Schemes, Security in Communication Network (SCN02), Lecture Notes in Computer Science, 2002. 266"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Lotspiech, and M. Naor, Digital Signets: Self-Enforcing Protection of Digital Information, Proceedings of the 28-th Symposium on the Theory of Computation, pp. 489\u2013498, 1996. 266","DOI":"10.1145\/237814.237997"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"P. Erdos, P. Frankl, and Z. Furedi, Families of finite subsets in which no set is covered by the union of r others, Israel Journal of Mathematics, N. 51, pp. 75\u201389, 1985. 268","DOI":"10.1007\/BF02772959"},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","first-page":"480","volume-title":"Broadcast Encryption","author":"A. Fiat","year":"1993","unstructured":"A. Fiat and M. Naor, Broadcast Encryption, Proceedings of Crypto\u2019 93, Lecture Notes in Computer Science, vol. 773, pp. 480\u2013491, 1994. 266, 270, 271, 272"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00145-001-0006-7","volume":"14","author":"A. Fiat","year":"2001","unstructured":"A. Fiat and T. Tessa, Dynamic Traitor Tracing, Journal of Cryptology, Vol. 14, pp. 211\u2013223, 2001. 266","journal-title":"Journal of Cryptology"},{"key":"18_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-48405-1_24","volume-title":"Advances in Cryptology-Crypto\u2019 99","author":"E. Gafni","year":"1999","unstructured":"E. Gafni, J. Staddon, and Y. L. Yin, Efficient Methods for Integrating Traceability and Broadcast Encryption, Advances in Cryptology-Crypto\u2019 99, Lecture Notes in Computer Science, vol. 1666, p. 372\u2013387, 1999. 266"},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44598-6_21","volume-title":"Advances in Cryptology-Crypto 2000","author":"J. Garay","year":"2000","unstructured":"J. Garay, J. Staddon, and A. Wool, Long-Lived Broadcast Encryption, Advances in Cryptology-Crypto 2000, Lecture Notes in Computer Science, vol. 1880, pp. 333\u2013352, 2000. 266"},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-45708-9_4","volume-title":"Advances in Cryptology-Crypto\u2019 02","author":"D. Halevy","year":"2002","unstructured":"D. Halevy and A. Shamir, The LSD Broadcast Encryption Scheme, Advances in Cryptology-Crypto\u2019 02, Lecture Notes in Computer Science, vol. 2442, pp. 47\u201360, 2002. 266"},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-46035-7_30","volume-title":"Advances in Cryptology-Eurocrypt\u2019 02","author":"A. Kiayias","year":"2002","unstructured":"A. Kiayias and M. Yung, Traitor Tracing with Constant Transmission Rate, Advances in Cryptology-Eurocrypt\u2019 02, Lecture Notes in Computer Science, vol. 2332, pp. 450\u2013465, 2002. 266"},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-44647-8_4","volume-title":"Advances in Cryptology-Crypto\u2019 01","author":"A. Kiayias","year":"2001","unstructured":"A. Kiayias and M. Yung, Self Protecting Pirates and Black-Box Traitor Tracing, Advances in Cryptology-Crypto\u2019 01, Lecture Notes in Computer Science, vol. 2139, pp. 63\u201379, 2001. 266"},{"key":"18_CR23","unstructured":"D. E. Knuth, The Art of Computer Programming, Addison Wesley, (3rd Edition), 1997. 273"},{"key":"18_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology-Crypto\u2019 99","author":"R. Kumar","year":"1999","unstructured":"R. Kumar, S. Rajagopalan, and A. Sahai, Coding Constructions for Blacklisting Problems without Computational Assumptions, Advances in Cryptology-Crypto\u2019 99, Lecture Notes in Computer Science, Vol. 1666, pp. 609\u2013623, 1999. 266, 267, 268"},{"key":"18_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Security in Communication Network (SCN02)","author":"H. Kurnio","year":"2002","unstructured":"H. Kurnio, R. Safani-Naini, and H. Wang, A Group Key Distribution Scheme with Decentralised User Join, Security in Communication Network (SCN02), Lecture Notes in Computer Science, 2002. 266"},{"key":"18_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-45450-0_4","volume-title":"ACISP 2002","author":"H. Kurnio","year":"2002","unstructured":"H. Kurnio, R. Safani-Naini, and H. Wang, A Secure Re-keying Scheme with Key Recovery Property, ACISP 2002, Lecture Notes in Computer Science, Vol. 2384, pp. 40\u201355, 2002. 266"},{"key":"18_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BFb0054150","volume-title":"Advances in Cryptology-Eurocrypt\u2019 98","author":"M. Luby","year":"1998","unstructured":"M. Luby and J. Staddon, Combinatorial Bounds for Broadcast Encryption, Advances in Cryptology-Eurocrypt\u2019 98, Lecture Notes in Computer Science, vol. 1403, pp. 512\u2013526, 1998. 266"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","volume":"21","author":"C. J. Mitchell","year":"1988","unstructured":"C. J. Mitchell and F.C. Piper, Key Storage in Secure Networks, Discrete Applied Mathematics, vol. 21, pp. 215\u2013228, 1988. 276","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology-Crypto\u2019 01","author":"D. Naor","year":"2001","unstructured":"D. Naor, M. Naor, and J. Lotspiech, Revocation and Tracing Schemes for Stateless Receivers Advances in Cryptology-Crypto\u2019 01, Lecture Notes in Computer Science, vol. 2139, pp. 41\u201362, 2001. 266"},{"key":"18_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","volume-title":"Financial Cryptography 2000","author":"M. Naor","year":"2000","unstructured":"M. Naor and B. Pinkas, Efficient Trace and Revoke Schemes, Financial Cryptography 2000, Lecture Notes in Computer Science, vol. 1962, pp. 1\u201321, 2000. 266"},{"key":"18_CR31","unstructured":"A. Perrig, D. Song, and J. D. Tygar, ELK, a new Protocol for Efficient Large-Group Key Distribution, in IEEE Symposium on Security and Privacy (2000). 266"},{"key":"18_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-61996-8_31","volume-title":"Information Hiding","author":"B. Pfitzmann","year":"1996","unstructured":"B. Pfitzmann, Trials of Traced Traitors, Information Hiding, Lecture Notes in Computer Science, vol. 1174, pp. 49\u201364, 1996. 266"},{"key":"18_CR33","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1007\/3-540-48405-1_39","volume":"1666","author":"R. Poovendran","year":"1999","unstructured":"R. Poovendran and J. S. Baras, An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes, Advances in Cryptology, Crypto\u2019 99, vol. 1666, pp. 624\u2013638, 1999. 266","journal-title":"Advances in Cryptology, Crypto\u2019 99"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"R. Safavi-Naini and H. Wang, New Constructions for Multicast Re-Keying Schemes Using Perfect Hash Families, 7th ACM Conference on Computer and Communication Security, ACM Press, pp. 228\u2013234, 2000. 266, 272","DOI":"10.1145\/352600.352637"},{"key":"18_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-44598-6_20","volume-title":"Sequential Traitor Tracing","author":"R. Safavi-Naini","year":"2000","unstructured":"R. Safavi-Naini and Y. Wang, Sequential Traitor Tracing, Lecture Notes in Computer Science, vol. 1880, p. 316\u2013332, 2000. 266"},{"key":"18_CR36","unstructured":"J. Staddon, S. Miner, M. Franklin, D. Balfanz, M. Malkin and D. Dean, Self-Healing Key Distribution with Revocation, IEEE Symposium on Security and Privacy, May 12\u201315, 2002, Berkeley, California. 266"},{"key":"18_CR37","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J. N. Staddon","year":"2001","unstructured":"J. N. Staddon, D. R. Stinson and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Transactions on Information Theory vol. 47, pp. 1042\u20131049, 2001. 266","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR38","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1008268610932","volume":"12","author":"D. R. Stinson","year":"1997","unstructured":"D. R. Stinson, On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption, Designs, Codes and Cryptography, vol. 12, pp. 215\u2013243, 1997. 266, 269, 274, 276","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR39","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1008209004667","volume":"15","author":"D. R. Stinson","year":"1998","unstructured":"D. R. Stinson and T. van Trung, Some New Results on Key Distribution Patterns and Broadcast Encryption, Designs, Codes and Cryptography, vol. 15, pp. 261\u2013279, 1998. 274, 275, 276","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR40","series-title":"Lect Notes Comput Sci","first-page":"144","volume-title":"Key preassigned traceability schemes for broadcast encryption","author":"D. R. Stinson","year":"1998","unstructured":"D. R. Stinson and R. Wei, Key preassigned traceability schemes for broadcast encryption, Proceedings of SAC\u201998, Lecture Notes in Computer Science, vol. 1556, pp. 144\u2013156, 1999. 266"},{"key":"18_CR41","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D. R. Stinson","year":"1998","unstructured":"D. R. Stinson and R. Wei, Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM Journal on Discrete Mathematics, vol. 11, pp. 41\u201353, 1998. 266","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR42","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(98)00204-X","volume":"69","author":"D. R. Stinson","year":"1999","unstructured":"D. R. Stinson and R. Wei, An Application of Ramp Schemes to Broadcast Encryption, Information Processing Letters, Vol. 69, pp. 131\u2013135, 1999. 274","journal-title":"Information Processing Letters"},{"key":"18_CR43","unstructured":"D. R. Stinson and R. Wei, Generalized Cover-Free Families, preprint. 269"},{"key":"18_CR44","unstructured":"D. M. Wallner, E. J. Harder, and R. C. Agee, Key Management for Multicast: Issues and Architectures, Internet Draft \n                    ftp:\/\/ftp.ieft.org\/internet-drafts\/draft-wallner-key-arch-01.txt\n                    \n                  . 266"},{"key":"18_CR45","unstructured":"C. Wong, and S. Lam, Keystone: A Group Key Management Service, in International Conference on Telecommunications, ICT 2000. 266"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36563-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:48:42Z","timestamp":1558262922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36563-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008477","9783540365631"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/3-540-36563-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}