{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:51:07Z","timestamp":1769521867405,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T00:00:00Z","timestamp":1508112000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11431003"],"award-info":[{"award-number":["11431003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571310"],"award-info":[{"award-number":["61571310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Scholars Program, Beijing Hundreds of Leading Talents Training Project of Science and Technology, and Beijing Municipal Natural Science Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10623-017-0420-y","type":"journal-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T09:44:56Z","timestamp":1508147096000},"page":"1727-1737","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["New upper bounds for parent-identifying codes and traceability codes"],"prefix":"10.1007","volume":"86","author":[{"given":"Chong","family":"Shangguan","sequence":"first","affiliation":[]},{"given":"Jingxue","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,16]]},"reference":[{"issue":"2","key":"420_CR1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1006\/jcta.2001.3177","volume":"95","author":"N Alon","year":"2001","unstructured":"Alon N., Fischer E., Szegedy M.: Parent-identifying codes. J. Combin. Theory A 95(2), 349\u2013359 (2001).","journal-title":"J. Combin. Theory A"},{"issue":"6","key":"420_CR2","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1017\/S0963548304006388","volume":"13","author":"N Alon","year":"2004","unstructured":"Alon N., Stav U.: New bounds on parent-identifying codes: the case of multiple parents. Comb. Probab. Comput. 13(6), 795\u2013807 (2004).","journal-title":"Comb. Probab. Comput."},{"issue":"2\u20133","key":"420_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jco.2003.08.012","volume":"20","author":"A Barg","year":"2004","unstructured":"Barg A., Kabatiansky G.: A class of I.P.P. codes with efficient identification. J. Complex. 20(2\u20133), 137\u2013147 (2004).","journal-title":"J. Complex."},{"issue":"3","key":"420_CR4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480101384633","volume":"16","author":"SR Blackburn","year":"2003","unstructured":"Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16(3), 499\u2013510 (2003). (Electronic).","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"420_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","volume":"102","author":"SR Blackburn","year":"2003","unstructured":"Blackburn S.R.: An upper bound on the size of a code with the \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -identifiable parent property. J. Comb. Theory A 102(1), 179\u2013185 (2003).","journal-title":"J. Comb. Theory A"},{"issue":"8","key":"420_CR6","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/j.jcta.2010.02.009","volume":"117","author":"SR Blackburn","year":"2010","unstructured":"Blackburn S.R., Etzion T., Ng S.: Traceability codes. J. Comb. Theory A 117(8), 1049\u20131057 (2010).","journal-title":"J. Comb. Theory A"},{"issue":"5","key":"420_CR7","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897\u20131905 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"420_CR8","doi-asserted-by":"crossref","first-page":"4843","DOI":"10.1109\/TIT.2011.2146130","volume":"57","author":"M Cheng","year":"2011","unstructured":"Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57(7), 4843\u20134851 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"420_CR9","doi-asserted-by":"crossref","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Advances in Cryptology\u2014CRYPTO94, pp. 257\u2013270. Springer, Berlin (1994)","DOI":"10.1007\/3-540-48658-5_25"},{"issue":"3","key":"420_CR10","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B Chor","year":"2000","unstructured":"Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inf. Theory 46(3), 893\u2013910 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"420_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"HDL 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. Comb. Theory A 82(2), 121\u2013133 (1998).","journal-title":"J. Comb. Theory A"},{"key":"420_CR12","first-page":"140","volume":"62","author":"S Owen","year":"2015","unstructured":"Owen S., Ng S.-L.: A note on an upper bound of traceability codes. Australas. J. Comb. 62, 140\u2013146 (2015).","journal-title":"Australas. J. Comb."},{"issue":"4","key":"420_CR13","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1137\/15M103827X","volume":"30","author":"C Shangguan","year":"2016","unstructured":"Shangguan C., Ge G.: Separating hash hamilies: a Johnson-type bound and new constructions. SIAM J. Discret. Math. 30(4), 2243\u20132264 (2016).","journal-title":"SIAM J. Discret. Math."},{"key":"420_CR14","doi-asserted-by":"publisher","unstructured":"Shangguan, C., Wang, X., Ge, G., Miao, Y.: New bounds for frameproof codes. IEEE Trans. Inf. Theory. doi:\n                        10.1109\/TIT.2017.2745619","DOI":"10.1109\/TIT.2017.2745619"},{"issue":"5","key":"420_CR15","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/TIT.2003.810630","volume":"49","author":"A Silverberg","year":"2003","unstructured":"Silverberg A., Staddon J., Walker J.L.: Applications of list decoding to tracing traitors. IEEE Trans. Inf. Theory 49(5), 1312\u20131318 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"420_CR16","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"JN Staddon","year":"2001","unstructured":"Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042\u20131049 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"420_CR17","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s10623-013-9800-0","volume":"72","author":"T Trung van","year":"2014","unstructured":"van Trung T.: A tight bound for frameproof codes viewed in terms of separating hash families. Des. Codes Cryptogr. 72(3), 713\u2013718 (2014).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0420-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T04:21:30Z","timestamp":1528086090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0420-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,16]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0420-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,16]]}}}