{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:37:00Z","timestamp":1743025020837,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_18","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"202-205","source":"Crossref","is-referenced-by-count":1,"title":["Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","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. Combinatorics, Probability and Computing\u00a013(6), 795\u2013807 (2004)","journal-title":"Combinatorics, Probability and Computing"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Amiri, E., Tardos, G.: High rate fingerprinting codes and fingerprinting capacity. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms (SODA 2009), pp. 336\u2013345 (2009)","DOI":"10.1137\/1.9781611973068.38"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Anthapadmanabhan, N.P., Barg, A.: Two-level fingerprinting: Stronger definitions and code constructions. In: Proc. IEEE Int. Sympos. Inform. Theory (ISIT 2010), Austin, TX, pp. 2528\u20132532 (2010)","DOI":"10.1109\/ISIT.2010.5513761"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A. Barg","year":"2003","unstructured":"Barg, A., Blakley, G.R., Kabatiansky, G.: Digital fingerprinting codes: Problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory\u00a049(4), 852\u2013865 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR5","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: the case of multiple parents. SIAM J. Discrete Math.\u00a014, 423\u2013431 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Barg, A., Kabatiansky, G.: Robust parent-identifying codes and combinatorial arrays (2010) (preprint)","DOI":"10.1109\/CIG.2010.5592920"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","volume":"102","author":"S. Blackburn","year":"2003","unstructured":"Blackburn, S.: An upper bound on the size of a code with the k-identifiable property. J. Combinatorial Theory Ser. A\u00a0102, 179\u2013185 (2003)","journal-title":"J. Combinatorial Theory Ser. A"},{"issue":"5","key":"18_CR8","doi-asserted-by":"publisher","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. Inform. Theory\u00a044(5), 1897\u20131905 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-01877-0_5","volume-title":"Coding and Cryptology","author":"I. Dumer","year":"2009","unstructured":"Dumer, I.: Equal-weight fingerprinting codes. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds.) IWCC 2009. LNCS, vol.\u00a05557, pp. 43\u201351. Springer, Heidelberg (2009)"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H.D.L. 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. Combinatorial Theory Ser. A\u00a082(2), 121\u2013133 (1998)","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Y., Moulin, P.: Saddle-point solution of the fingerpinting capacity game. In: Proc. IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, pp. 2256\u20132260 (2009)","DOI":"10.1109\/ISIT.2009.5205882"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:30:11Z","timestamp":1578533411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_18"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}