{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:48Z","timestamp":1725493608748},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433194"},{"type":"electronic","value":"9783540458616"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45861-1_14","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:40:01Z","timestamp":1193553601000},"page":"178-185","source":"Crossref","is-referenced-by-count":4,"title":["Binary Codes for Collusion-Secure Fingerprinting"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property. SIAM J. on Discrete Math. 14 (2001) 423\u2013431","journal-title":"SIAM J. on Discrete Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"IT-44","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-Secure Fingerprinting for Digital Data. IEEE Trans. Inf. Theory. IT-44 (1998) 1897\u20131905 (preliminary version in Crypto\u201995).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(85)90190-6","volume":"56","author":"G. Cohen","year":"1985","unstructured":"Cohen, G., Lempel, A.: Linear intersecting codes. Discrete Math. 56 (1985) 35\u201343","journal-title":"Discrete Math."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/jcta.2000.3127","volume":"94","author":"G. Cohen","year":"2001","unstructured":"Cohen, G., Litsyn, S., Z\u00e9mor, G.: Binary B\n                        2-Sequences: a new upper bound. J. Combinatorial Theory, Series A. 94 (2001) 152\u2013155","journal-title":"J. Combinatorial Theory"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"IT-40","author":"G. Cohen","year":"1994","unstructured":"Cohen, G., Z\u00e9mor, G.: Intersecting codes and independent families. IEEE Trans. Inf. Theory. IT-40 (1994) 1872\u20131881","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H.D. Hollmann","year":"1998","unstructured":"Hollmann, H.D., van Lint, J.H., Linnartz, J.-P., Tolhuizen, L.M.: On codes with the identifiable parent property. J. Combinatorial Theory, Series A. 82 (1998) 121\u2013133","journal-title":"J. Combinatorial Theory"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0378-3758(83)90053-8","volume":"8","author":"G. Katona","year":"1983","unstructured":"Katona, G., Srivastava, J.: Minimal 2-coverings of a finite affine space based on GF(2). J. Stat. Planning and Inference. 8 (1983) 375\u2013388","journal-title":"J. Stat. Planning and Inference"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0022-314X(72)90052-2","volume":"4","author":"B. Lindstr\u00f6m","year":"1972","unstructured":"Lindstr\u00f6m, B.: On B\n                        2-Sequences of Vectors. J. of Number Theory. 4 (1972) 261\u2013265","journal-title":"J. of Number Theory"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(84)90018-0","volume":"9","author":"D. Mikl\u00f3s","year":"1984","unstructured":"Mikl\u00f3s, D.: Linear binary codes with intersection properties. Discrete Appl. Math. 9 (1984) 187\u2013196","journal-title":"Discrete Appl. Math."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"IT-23","author":"R. J. McEliece","year":"1977","unstructured":"McEliece, R. J., Rodemich, E. R., Rumsey, H. C. Welch, L. R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory. IT-23 (1977) 157\u2013166","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR11","first-page":"62","volume":"4","author":"Yu. L. Sagalovitch","year":"1968","unstructured":"Sagalovitch, Yu. L.: Methods of introducing redundancy for raising the reliability of a finite automaton. Problems of Information Transmission. 4 (1968) 62\u201372","journal-title":"Problems of Information Transmission"},{"key":"14_CR12","first-page":"105","volume":"30","author":"Yu. L. Sagalovitch","year":"1994","unstructured":"Sagalovitch, Yu. L.: Separating systems. Problems of Information Transmission. 30 (1994) 105\u2013123","journal-title":"Problems of Information Transmission"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N. J. A. Sloane","year":"1993","unstructured":"Sloane, N. J. A.: Covering arrays and intersecting codes. J. Combinator. Designs. 1 (1993) 51\u201363","journal-title":"J. Combinator. Designs"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"IT-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. Inf. Theory. IT-47 (2001) 1042\u20131049","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Tran Van Trung, Wei, R.: Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures. J. Stat. Planning and Inference. 86 (2000) 595\u2013617","journal-title":"J. Stat. Planning and Inference"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11 (1998) 41\u201353.","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45861-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:21:13Z","timestamp":1551028873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45861-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433194","9783540458616"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45861-1_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}