{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:23Z","timestamp":1725487043093},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002635"},{"type":"electronic","value":"9783540362319"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36231-2_13","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T15:21:45Z","timestamp":1183389705000},"page":"149-163","source":"Crossref","is-referenced-by-count":10,"title":["A 2-Secure Code with Efficient Tracing Algorithm"],"prefix":"10.1007","author":[{"given":"T\u00f4","family":"Vu Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Safavi-Naini","family":"Reihaneh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Yejing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"M. Atici, S. S. Magliveras, D.R. Stinson, and W.D. Wei. Some recursive constructions for perfect hash families. Journal of Combinatorial Designs, 4:353\u2013363, 1996.8-353.","journal-title":"Journal of Combinatorial Designs"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","first-page":"33","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"D. Boneh","year":"1999","unstructured":"D. Boneh and M. Franklin. An effcient public key traitor tracing scheme. In Advances in Cryptology-CRYPTO\u201999, Lecture Notes in Computer Science, volume 1666, pages 33Springer-Verlag, Berlin, Heidelberg, New York, 1999."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","first-page":"453","volume-title":"Advances in Cryptology-CRYPTO\u201995","author":"D. Boneh","year":"1995","unstructured":"D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. In Advances in Cryptology-CRYPTO\u201995, Lecture Notes in Computer Science, volume 963, pages 453\u2013465. Springer-Verlag, Berlin, Heidelberg, New York, 1995."},{"issue":"5","key":"13_CR4","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, Vol. 44, No. 5:1897\u20131905, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"20","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1049\/el:20001231","volume":"36","author":"J. Domingo-Ferrer","year":"2000","unstructured":"J. Domingo-Ferrer and J. Herrera-Joancomarti. Short collusion-secure fingerprints based on dual binary hamming codes. Electronics Letters, Vol. 36, No. 20:1697\u20131699, 2000.","journal-title":"Electronics Letters"},{"key":"13_CR6","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-CRYPTO\u201993","author":"A. Fiat","year":"1994","unstructured":"A. Fiat and M. Naor. Broadcast encryption. In Advances in Cryptology-CRYPTO\u201993, Lecture Notes in Computer Science, volume 773, pages 480\u2013491. Springer-Verlag, Berlin, Heidelberg, New York, 1994."},{"key":"13_CR7","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\u201901","author":"A. Kiayias","year":"2001","unstructured":"A. Kiayias and M. Yung. Self protecting pirates and black-box traitor tracing. In Advances in Cryptology-CRYPTO\u201901, Lecture Notes in Computer Science, volume 2139, pages 63\u201379. Springer-Verlag, Berlin, Heidelberg, New York, 2001."},{"key":"13_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-47870-1_5","volume-title":"Security and Privacy in Digital Rights Management (SPDRM 2001)","author":"R. Safavi-Naini","year":"2002","unstructured":"R. Safavi-Naini and Y. Wang. Collusion secure q-ary fingerprinting for perceptual content. In Security and Privacy in Digital Rights Management (SPDRM 2001), Lecture Notes in Computer Science, volume 2320, pages 57\u201375. Springer-Verlag, Berlin, Heidelberg, New York, 2002."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45450-0_25","volume-title":"Short 3-secure fingerprinting codes for copyright protection","author":"F. Sebe","year":"2002","unstructured":"F. Sebe and J. Domingo-Ferrer. Short 3-secure fingerprinting codes for copyright protection. In Proceedings of ACISP\u201902, Lecture Notes in Computer Science, volume 2384, pages 316\u2013327. Springer-Verlag, Berlin, Heidelberg, New York, 2002."},{"issue":"3","key":"13_CR10","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, No. 3:1042\u20131049, 2001.","journal-title":"IEEE transactions on information theory"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D. Stinson","year":"2000","unstructured":"D. Stinson, T. Trung, and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference, 86(2):595\u2013617, 2000.","journal-title":"Journal of Statistical Planning and Inference"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D. Stinson","year":"1998","unstructured":"D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Mathematics, 11:41\u201353, 1998.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-48892-8_12","volume-title":"Key preassigned traceability schemes for broadcast encryption","author":"D.R. Stinson","year":"1999","unstructured":"D.R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC\u201998, Lecture Notes in Computer Science, volume 1556, pages 144\u2013156. Springer-Verlag, Berlin, Heidelberg, New York, 1999."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36231-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T15:48:36Z","timestamp":1550418516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36231-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002635","9783540362319"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36231-2_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}