{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:35Z","timestamp":1725549215842},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241300"},{"type":"electronic","value":"9783540305569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30556-9_32","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:18:36Z","timestamp":1267460316000},"page":"414-429","source":"Crossref","is-referenced-by-count":0,"title":["Identification Algorithms for Sequential Traitor Tracing"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Soriano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1137\/S0097539700367984","volume":"30","author":"O. Berkman","year":"2001","unstructured":"Berkman, O., Parnas, M., Sgall, J.: Efficient dynamic traitor tracing. SIAM J. Computing\u00a030(6), 1802\u20131828 (2001)","journal-title":"SIAM J. Computing"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 338\u2013353. Springer, Heidelberg (1999)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","first-page":"480","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-48405-1_23","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Fiat","year":"1999","unstructured":"Fiat, A., Tassa, T.: Dynamic traitor tracing. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 354\u2013371. Springer, Heidelberg (1999)"},{"issue":"6","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory\u00a045(6), 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32_CR6","unstructured":"Guruswami, V.: List Decoding of Error-Correcting Codes. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (September 2001)"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H.D.L. Hollmann","year":"1998","unstructured":"Hollmann, H.D.L., van Lint, J.H., Linnartz, J.P., Tolhuizen, L.M.G.M.: On codes with the Identifiable Parent Property. J. Combinatorial Theory\u00a082(2), 121\u2013133 (1998)","journal-title":"J. Combinatorial Theory"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Koetter, R., Vardy, A.: Algebraic soft-decision decoding of Reed-Solomon codes. In: ISIT 2000 (2000)","DOI":"10.1109\/ISIT.2000.866351"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0054123","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"K. Kurosawa","year":"1998","unstructured":"Kurosawa, K., Desmedt, Y.: Optimal traitor tracing and asymetric schemes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 145\u2013157. Springer, Heidelberg (1998)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44598-6_20","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"R. Safavi-Naini","year":"2000","unstructured":"Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 316\u2013332. Springer, Heidelberg (2000)"},{"issue":"5","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/TIT.2003.810629","volume":"49","author":"R. Safavi-Naini","year":"2003","unstructured":"Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. IEEE Trans. Inform. Theory\u00a049(5), 1319\u20131326 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-45682-1_11","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Silverberg","year":"2001","unstructured":"Silverberg, A., Staddon, J., Walker, J.: Efficient traitor tracing algorithms using list decoding. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 175. Springer, Heidelberg (2001)"},{"issue":"3","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory\u00a047(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32_CR14","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Berlin (1993)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Trung, T.V., Martirosyan, S.: New constructions for ipp codes. In: Proc. IEEE International Symposium on Information Theory, ISIT 2003, p. 255 (2003)","DOI":"10.1109\/ISIT.2003.1228269"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30556-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:09Z","timestamp":1605759729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30556-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241300","9783540305569"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30556-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}