{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:21:35Z","timestamp":1737609695166,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430100"},{"type":"electronic","value":"9783540453116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45311-3_12","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T19:01:41Z","timestamp":1195066901000},"page":"117-126","source":"Crossref","is-referenced-by-count":13,"title":["Frameproof and IPP Codes"],"prefix":"10.1007","author":[{"given":"Palash","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. Alon","year":"1986","unstructured":"N. Alon. Explicit construction of exponential sized families of k-independent sets. Discrete Mathematics, Volume 58(1986), pp 191\u2013193.","journal-title":"Discrete Mathematics"},{"key":"12_CR2","unstructured":"S.R. Blackburn. Frameproof codes. Preprint, 2000."},{"key":"12_CR3","unstructured":"S.R. Blackburn. Frameproof codes. Preprint, 2001."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Z\u00e9mor. A hypergraph approach to identifying parent property: the case of multiple parents. DIMACS Technical Report 2000-20.","DOI":"10.1016\/S1571-0653(04)00151-9"},{"key":"12_CR5","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. Collision-secure fingerprinting for digital data. IEEE Transactions on Information Theory, Volume 44(1998), pp 1897\u20131905.","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"Z.J. Czech","year":"1997","unstructured":"Z.J. Czech, G. Havas and B.S. Majewski. Perfect hashing. Theoretical Computer Science, Volume 182 (1997), pp 1\u2013143.","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"J. Friedman. Constructing O(n log n) size monotone formulae for the kth elementary symmetric polynomial of n Boolean variables. Proceedings of the 25th Annual Symposium on Foundations of Computer Science, (1984), 506\u2013515.","DOI":"10.1109\/SFCS.1984.715953"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H.D.L. Hollman","year":"1998","unstructured":"H.D.L. Hollman, J.H. van Lint, J-P. Linnartz and L.M.G.M. Tolhuizen. On codes with the identifiable parent property. Journal of Combinatorial Theory A, Volume 82 (1998), pp 121\u2013133.","journal-title":"Journal of Combinatorial Theory A"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"P. Sarkar and D. R. Stinson. Frameproof and IPP codes. CACR Technical Report CORR 2001-12, University of Waterloo, http:\/\/www.cacr.math.uwaterloo.ca , 2001.","DOI":"10.1007\/3-540-45311-3_12"},{"key":"12_CR10","unstructured":"J.N. Staddon, D.R. Stinson and R. Wei. Combinatorial properties of frameproof and traceability codes. CACR Technical Report CORR 2000-16, University of Waterloo, http:\/\/cacr.math.uwaterloo.ca , 2000."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"D.R. Stinson, T. van Trung and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference, Volume 86 (2000), pp 596\u2013617.","journal-title":"Journal of Statistical Planning and Inference"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"D.R. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal of Discrete Mathematics, Volume 11 (1998), pp 41\u201353.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"12_CR13","doi-asserted-by":"publisher","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","unstructured":"D.R. Stinson, R. Wei and L. Zhu. New constructions for perfect hash families and related structures using combinatorial designs and codes. Journal of Combinatorial Designs, Volume 8 (2000), pp 189\u2013200.","journal-title":"Journal of Combinatorial Designs"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45311-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T10:06:52Z","timestamp":1737540412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45311-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430100","9783540453116"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45311-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}