{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:06:14Z","timestamp":1757311574495},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T00:00:00Z","timestamp":1424217600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10623-015-0037-y","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T07:31:02Z","timestamp":1424158262000},"page":"301-319","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On tight bounds for binary frameproof codes"],"prefix":"10.1007","volume":"77","author":[{"given":"Chuan","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran","family":"van Trung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,18]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.jcta.2010.11.006","volume":"118","author":"M Bazrafshan","year":"2011","unstructured":"Bazrafshan, M., van Trung, T.: Bounds for separating hash families. J. Combin. Theory A 118, 1129\u20131135 (2011)","journal-title":"J. Combin. Theory A"},{"key":"37_CR2","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. Discrete Math. 16, 499\u2013510 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"37_CR3","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-free fingerprinting for digital data. IEEE Trans. Inform. Theory 44, 1897\u20131905 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology\u2014CRYPTO\u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) Advances in Cryptology\u2014CRYPTO\u201994. Lecture Notes in Computer Science, vol. 839, pp. 257\u2013270. Springer, Berlin (1994)"},{"key":"37_CR5","unstructured":"Colbourn C.J., Horsley D., Syrotiuk V.R.: Frameproof codes and compressive sensing, forty-eighth annual allerton conference, Allerton House, UIUC, Illinois, USA, Sept 29\u2013Oct 1, 2010, 985\u2013990 (2010)"},{"key":"37_CR6","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\u2014CRYPTO99","author":"A Fiat","year":"1999","unstructured":"Fiat, A., Tassa, T.: Dynamic traitor tracing. In: Weiner, M. (ed.) Advances in Cryptology\u2014CRYPTO99. Lecture Notes in Computer Science, vol. 1666, pp. 354\u2013371. Springer, Berlin (1999)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Sarkar P., Stinson D.R.: Frameproof and IPP Codes, Progress in Cryptology\u2014Indocrypt. Lecture Notes in Computer Science. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45311-3_12"},{"key":"37_CR8","unstructured":"Shangguan C., Wang X., Ge G. and Miao Y.: New Bounds For Frameproof Codes. Preprint, 2014. http:\/\/arxiv.org\/pdf\/1411.5782v1"},{"key":"37_CR9","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. Inform. Theory 47, 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Statist. Plan. Inference 86, 595\u2013617 (2000)","journal-title":"J. Statist. Plan. Inference"},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11, 41\u201353 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"37_CR12","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s10623-013-9800-0","volume":"72","author":"Tran Trung van","year":"2014","unstructured":"van Trung, Tran: A tight bound for frameproof codes viewed in terms of separating hash families. Des. Codes Cryptogr. 72, 713\u2013718 (2014)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0037-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0037-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0037-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:04:59Z","timestamp":1566345899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0037-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,18]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0037-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,18]]}}}