{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:52:27Z","timestamp":1723233147394},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10623-005-6402-5","type":"journal-article","created":{"date-parts":[[2005,3,21]],"date-time":"2005-03-21T19:32:28Z","timestamp":1111433548000},"page":"227-239","source":"Crossref","is-referenced-by-count":28,"title":["New Constructions for IPP Codes"],"prefix":"10.1007","volume":"35","author":[{"given":"Tran Van","family":"Trung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sosina","family":"Martirosyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. A lon","year":"1986","journal-title":"iscrete Math"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","journal-title":"SIAM J. Discrete. Math."},{"key":"CR3","unstructured":"D. Boneh and M. Franklin, An efficient public key traitor tracing schemes, In Advances in Cryptology - Crypto?94, Lecture Notes in Computer Science, Springer-Verlag (1994) pp. 257?270."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1214\/aoms\/1177729449","volume":"23","author":"K. A. Bush","year":"1952","journal-title":"Ann. Math. Stat."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).","DOI":"10.1201\/9781420049954"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"ZJ Czech","year":"1997","journal-title":"Theor. Comp. Sci."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Fiat and M. Naor, Tracing traitors, In Advances in Cryptology - Crypto?94, Lecture Notes in Computer Science, Springer-Verlag (1994) pp. 257?270.","DOI":"10.1007\/3-540-48658-5_25"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/18.841169","volume":"46","author":"B. Chor","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"A. Fiat and T. Tassa, Dynamic traitor tracing, In Advances in Cryptology Crypto?99, Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 354?371.","DOI":"10.1007\/3-540-48405-1_23"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00145-001-0006-7","volume":"14","author":"A. Fiat","year":"2001","journal-title":"J. Cryptology"},{"key":"CR12","unstructured":"kE. Gafni, J. Staddon, and Y. L. Yin, Efficient methods for integrating traceability and broadcast encryption, In Advances in Cryptology?Crypto?99, Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 372?387."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR14","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?190.","DOI":"10.1145\/335305.335327"},{"key":"CR15","unstructured":"V. Guruswami, List Decoding of Error-Correcting Codes, PhD Thesis, MIT (2001)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H. D. L. Hollmann","year":"1998","journal-title":"J. Comb. Theory A"},{"key":"CR17","unstructured":"S. S. Martirosyan and S. S. Martirosyan, New upper bound on the cardinality of a K-separated set or perfect hash family and a near optimal construction for it, Trans. IPIA of NAN RA & YSU ??Mathematical Problems of Computer Science??, Vol. XXI (2000) pp. 104?115."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1109\/18.959283","volume":"47","author":"R. Safavi-Naini","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR19","unstructured":"P.Sarkar, D. R. Stinson, Frameproof and IPP Codes, Preprint."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-45682-1_11","volume":"2248","author":"A. Silverberg","year":"2001","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J. N. Staddon","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D. R. Stinson","year":"2000","journal-title":"J. Statist. Planning Inference"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D. R. Stinson","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A","volume":"8","author":"D. R. Stinson","year":"2000","journal-title":"J. Combin. Designs"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M Sudan","year":"1997","journal-title":"J. Complexity"},{"key":"CR26","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) pp. 215?224."},{"key":"CR27","unstructured":"ran van Trung and Sosina Martirosyan, On a class of traceability codes, to appear in Designs, Codes and Cryptography."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-6402-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-005-6402-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-6402-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T11:48:56Z","timestamp":1586173736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-005-6402-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["6402"],"URL":"https:\/\/doi.org\/10.1007\/s10623-005-6402-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}