{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:21Z","timestamp":1772283621030,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429876","type":"print"},{"value":"9783540456827","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45682-1_11","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T06:31:48Z","timestamp":1180161108000},"page":"175-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Efficient Traitor Tracing Algorithms Using List Decoding"],"prefix":"10.1007","author":[{"given":"Alice","family":"Silverberg","sequence":"first","affiliation":[]},{"given":"Jessica","family":"Staddon","sequence":"additional","affiliation":[]},{"given":"Judy L.","family":"Walker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory\n                  38 (1992), 509\u2013516.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Z\u00e9mor. A hypergraph approach to the identifying parent property: the case of multiple parents, DIMACS Technical Report 2000-20.","DOI":"10.1016\/S1571-0653(04)00151-9"},{"key":"11_CR3","unstructured":"O. Berkman, M. Parnas and J. Sgall. Efficient dynamic traitor tracing, in 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 586\u2013595."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. R. Berlekamp","year":"1978","unstructured":"E. R. Berlekamp, R. J. McEliece and H. C. A. van Tilborg. On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\n                  24 (1978), 384\u2013386.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR5","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 \u2014 Crypto\u2019 99","author":"D. Boneh","year":"1999","unstructured":"D. Boneh and M. Franklin. An efficient public key traitor tracing scheme, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 99\u201d, Lecture Notes in Computer Science\n                  1666 (1999), 338\u2013353."},{"key":"11_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 95","author":"D. Boneh","year":"1995","unstructured":"D. Boneh and J. Shaw. Collusion secure fingerprinting for digital data, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 95\u201d, Lecture Notes in Computer Science\n                  963 (1995), 452\u2013465."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","unstructured":"D. Boneh and J. Shaw. Collusion secure fingerprinting for digital data, IEEE Transactions on Information Theory\n                  44 (1998), 1897\u20131905.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR8","first-page":"1673","volume":"6","author":"I. Cox","year":"1997","unstructured":"I. Cox, J. Kilian, T. Leighton and T. Shamoon. Secure spreadsp ectrum watermarking for multimedia. IEEE Transactions on Information Theory\n                  6 (1997), 1673\u20131687.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","first-page":"480","volume-title":"Advances in Cryptology \u2014Crypto\u2019 94","author":"B. Chor","year":"1994","unstructured":"B. Chor, A. Fiat and M. Naor. Tracing traitors, in \u201cAdvances in Cryptology \u2014Crypto\u2019 94\u201d, Lecture Notes in Computer Science\n                  839 (1994), 480\u2013491."},{"key":"11_CR10","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. Tracing traitors, IEEE Transactions on Information Theory\n                  46 (2000), 893\u2013910.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Lotspiech and M. Naor. Digital Signets: Self-Enforcing Protection of Digital Information, in Proc. 28th ACM Symposium on Theory of Computing (STOC 1997), 489\u2013498.","DOI":"10.1145\/237814.237997"},{"key":"11_CR12","unstructured":"G.-L. Feng. Very Fast Algorithms in Sudan Decoding Procedure for Reed-Solomon Codes. Preprint."},{"key":"11_CR13","unstructured":"G.-L. Feng. Fast Algorithms in Sudan Decoding Procedure for Hermitian Codes. Preprint."},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 93","author":"A. Fiat","year":"1994","unstructured":"A. Fiat and M. Naor. Broadcast Encryption, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 93\u201d, Lecture Notes in Computer Science\n                  773 (1994), 480\u2013491."},{"key":"11_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-48405-1_23","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 99","author":"A. Fiat","year":"1999","unstructured":"A. Fiat and T. Tassa. Dynamic traitor tracing, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 99\u201d, Lecture Notes in Computer Science\n                  1666 (1999), 354\u2013371."},{"key":"11_CR16","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 \u2014 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, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 99\u201d, Lecture Notes in Computer Science\n                  1666 (1999), 372\u2013387."},{"key":"11_CR17","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 \u2014 Crypto 2000","author":"J. Garay","year":"2000","unstructured":"J. Garay, J. Staddon and A. Wool, Long-Lived Broadcast Encryption, in \u201cAdvances in Cryptology \u2014 Crypto 2000\u201d, Lecture Notes in Computer Science\n                  1880 (2000), 333\u2013352."},{"key":"11_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-6870-8","volume-title":"Geometry and codes","author":"V. D. Goppa","year":"1988","unstructured":"V. D. Goppa. Geometry and codes. Kluwer Academic Publishers, Dordrecht, 1988."},{"issue":"6","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraicgeometry codes, IEEE Transactions on Information Theory\n                  45(6) (1999), 1757\u20131767.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes, in Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), 181\u2013190.","DOI":"10.1145\/335305.335327"},{"key":"11_CR21","first-page":"221","volume-title":"Coding theory, cryptography and related areas (Guanajuato, 1998)","author":"T. H\u00f8holdt","year":"2000","unstructured":"T. H\u00f8holdt and R. R. Nielsen. Decoding Reed-Solomon codes beyond half the minimum distance, in Coding theory, cryptography and related areas (Guanajuato, 1998), Springer, Berlin (2000), 221\u2013236."},{"key":"11_CR22","unstructured":"T. H\u00f8holdt and R. R. Nielsen. Decoding Hermitian codes with Sudan\u2019s algorithm. To appear in the 13th AAECC Symposium."},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H. D. L. Hollmann","year":"1998","unstructured":"H. D. L. Hollmann, J. H. van Lint, J-P. Linnartz and L. M. G. M. Tolhuizen. On codes with the identifiable parent property, Journal of Combinatorial Theory A\n                  82 (1998), 121\u2013133.","journal-title":"Journal of Combinatorial Theory A"},{"key":"11_CR24","unstructured":"R. Koetter and A. Vardy. Algebraic soft-decision decoding of Reed-Solomon codes. Preprint. \n                    http:\/\/www.dia.unisa.it\/isit2000\/lavori\/455.ps\n                    \n                  ."},{"key":"11_CR25","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 \u2014 Crypto\u2019 99","author":"R. Kumar","year":"1999","unstructured":"R. Kumar, S. Rajagopalan and A. Sahai. Coding constructions for blacklisting problems without computational assumptions, in \u201cAdvances in Cryptology \u2014 Crypto\u2019 99\u201d, Lecture Notes in Computer Science\n                  1666 (1999), 609\u2013623."},{"key":"11_CR26","unstructured":"K. Kurosawa, M. Burmester and Y. Desmedt. A proven secure tracing algorithm for the optimal KD traitor tracing scheme. DIMACS Workshop on Management of Digital Intellectual Properties, April, 2000, and Euro crypt 2000 rump session."},{"key":"11_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0054123","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 98","author":"K. Kurosawa","year":"1998","unstructured":"K. Kurosawa and Y. Desmedt. Optimal traitor tracing andasymmetric schemes, in \u201cAdvances in Cryptology \u2014 Eurocrypt\u2019 98\u201d, Lecture Notes in Computer Science\n                  1438 (1998), 145\u2013157."},{"key":"11_CR28","volume-title":"Graduate Texts in Mathematics","author":"J. H. Lint van","year":"1999","unstructured":"J. H. van Lint. Introduction to coding theory. Third edition. Graduate Texts in Mathematics 86, Springer-Verlag, Berlin (1999).","edition":"Third edition"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas. Efficient Trace and Revoke Schemes, to appear in Proceedings of Financial Cryptography 2000.","DOI":"10.1007\/3-540-45472-1_1"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"V. Olshevsky and A. Shokrollahi. A displacement structure approach to efficient decoding of algebraic geometric codes, in Proc. 31st ACM Symposium on Theory of Computing (STOC 1999), 235\u2013244.","DOI":"10.1145\/301250.301311"},{"key":"11_CR31","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 tracedtraitors, in Information Hiding, First International Workshop, Lecture Notes in Computer Science\n                  1174 (1996), 49\u201364."},{"key":"11_CR32","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/18.817522","volume":"46","author":"R. M. Roth","year":"2000","unstructured":"R. M. Roth and G. Ruckenstein. Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory\n                  46 (2000), 246\u2013257.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44598-6_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"R. Safavi-Naini","year":"2000","unstructured":"R. Safavi-Naini and Y. Wang. Sequential Traitor Tracing, in \u201cAdvances in Cryptology \u2014 CRYPTO 2000\u201d, Lecture Notes in Computer Science\n                  1880 (2000), 316\u2013332."},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/18.179365","volume":"39","author":"B.-Z. Shen","year":"1993","unstructured":"B.-Z. Shen. A Justesen construction of binary concatenatedco des that asymptotically meet the Zyablov boundfor low rate, IEEE Transactions on Information Theory\n                  39 (1993), 239\u2013242.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"M. A. Shokrollahi and H. Wassermann. Decoding Algebraic-Geometric Codes Beyondthe Error-Correction Bound, in Proc. 30th ACM Symposium on Theory of Computing (STOC 1998), 241\u2013248.","DOI":"10.1145\/276698.276753"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/18.748993","volume":"45","author":"M. A. Shokrollahi","year":"1999","unstructured":"M. A. Shokrollahi and H. Wassermann. List Decoding of Algebraic-Geometric Codes. IEEE Transactions on Information Theory\n                  45 (1999), 893\u2013910.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR37","unstructured":"J. N. Staddon, D. R. Stinson and R. Wei. Combinatorial properties of frameproof and traceability codes. To appear in IEEE Transactions on Information Theory."},{"key":"11_CR38","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"H. Stichtenoth. Algebraic Function Fields and Codes. Springer-Verlag, Berlin, 1993."},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D. R. Stinson","year":"2000","unstructured":"D. R. Stinson, Tran van Trung and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms andrelatedstructures, Journal of Statistical Planning and Inference\n                  86 (2000), 595\u2013617.","journal-title":"Journal of Statistical Planning and Inference"},{"key":"11_CR40","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 andconstructions of traceability schemes andframepro of codes, SIAM Journal on Discrete Mathematics\n                  11 (1998), 41\u201353.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR41","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-48892-8_12","volume-title":"SelectedAreas in Cryptology \u2014 SAC\u2019 98","author":"D. R. Stinson","year":"1999","unstructured":"D. R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption, in \u201cSelectedAreas in Cryptology \u2014 SAC\u2019 98\u201d, Lecture Notes in Computer Science\n                  1556 (1999), 144\u2013156."},{"issue":"1","key":"11_CR42","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity\n                  13(1) (1997), 180\u2013193.","journal-title":"Journal of Complexity"},{"key":"11_CR43","unstructured":"M. Sudan. Decoding of Reed Solomon codes beyond the error-correction diameter, in Proc. 35th Annual Allerton Conference on Communication, Control and Computing (1997), 215\u2013224."},{"key":"11_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-geometric codes","author":"M. A. Tsfasman","year":"1991","unstructured":"M. A. Tsfasman and S. G. Vl\u0103du\u0163. Algebraic-geometric codes. Kluwer Academic Publishers, Dordrecht, 1991."},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/mana.19821090103","volume":"109","author":"M. A. Tsfasman","year":"1982","unstructured":"M. A. Tsfasman, S. G. Vl\u0103du\u0163. and Th. Zink. Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound. Math. Nachr.\n                  109 (1982), 21\u201328.","journal-title":"Math. Nachr."},{"key":"11_CR46","unstructured":"W.-G. Tzeng and Z.-J. Tzeng. A Traitor Tracing Scheme Using Dynamic Shares, to appear in PKC2001."},{"key":"11_CR47","unstructured":"X.-W. Wu and P. H. Siegel. Efficient List Decoding of Algebraic Geometric Codes Beyondthe Error Correction Bound, submittedto IEEE Transactions on Information Theory."},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"F. Zane. Efficient Watermark Detection andCollusion Security, to appear in Proceedings of Financial Cryptography 2000.","DOI":"10.1007\/3-540-45472-1_2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:38:27Z","timestamp":1558273107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}