{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:11:01Z","timestamp":1648627861340},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T00:00:00Z","timestamp":1451865600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. on Info. Security"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s13635-015-0026-8","type":"journal-article","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T12:46:12Z","timestamp":1451911572000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders"],"prefix":"10.1186","volume":"2016","author":[{"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"R Dorfman, The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436\u2013440 (1943).","journal-title":"Ann. Math. Stat"},{"issue":"5","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"D Boneh, J Shaw, Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory. 44(5), 1897\u20131905 (1998). doi: 10.1109\/18.705568 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"G Tardos, in STOC. Optimal probabilistic fingerprint codes, (2003), pp. 116\u2013125. doi: 10.1145\/780542.780561 .","DOI":"10.1145\/780542.780561"},{"key":"26_CR4","first-page":"336","volume-title":"SODA","author":"E Amiri","year":"2009","unstructured":"E Amiri, G Tardos, in SODA. High rate fingerprinting codes and the fingerprinting capacity (SIAMPhiladelphia, PA, USA, 2009), pp. 336\u2013345."},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/TIFS.2011.2168212","volume":"7","author":"Y-W Huang","year":"2012","unstructured":"Y-W Huang, P Moulin, On the saddle-point solution and the large-coalition asymptotics of fingerprinting games. IEEE Trans. Inf. Forensics Secur. 7(1), 160\u2013175 (2012). doi: 10.1109\/TIFS.2011.2168212 .","journal-title":"IEEE Trans. Inf. Forensics Secur"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10623-008-9200-z","volume":"48","author":"O Blayer","year":"2008","unstructured":"O Blayer, T Tassa, Improved versions of Tardos\u2019 fingerprinting scheme. Designs Codes Crypt. 48(1), 79\u2013103 (2008). doi: 10.1007\/s10623-008-9200-z .","journal-title":"Designs Codes Crypt"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10623-012-9718-y","volume":"71","author":"T Laarhoven","year":"2014","unstructured":"T Laarhoven, B de Weger, Optimal symmetric Tardos traitor tracing schemes. Designs Codes Crypt. 71(1), 83\u2013103 (2014). doi: 10.1007\/s10623-012-9718-y .","journal-title":"Designs Codes Crypt"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10623-009-9285-z","volume":"52","author":"K Nuida","year":"2009","unstructured":"K Nuida, S Fujitsu, M Hagiwara, T Kitagawa, H Watanabe, K Ogawa, H Imai, An improvement of discrete Tardos fingerprinting codes. Designs Codes Crypt. 52(3), 339\u2013362 (2009). doi: 10.1007\/s10623-009-9285-z .","journal-title":"Designs Codes Crypt"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10623-007-9142-x","volume":"46","author":"B Skoric","year":"2008","unstructured":"B Skoric, S Katzenbeisser, MU Celik, Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. Designs Codes Crypt. 46(2), 137\u2013166 (2008). doi: 10.1007\/s10623-007-9142-x .","journal-title":"Designs Codes Crypt"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"T Laarhoven, B de Weger, in IH&MMSec. Discrete distributions in the Tardos scheme, revisited, (2013), pp. 13\u201318. doi: 10.1145\/2482513.2482533 .","DOI":"10.1145\/2482513.2482533"},{"issue":"12","key":"26_CR11","doi-asserted-by":"publisher","first-page":"5999","DOI":"10.1109\/TIT.2010.2080910","volume":"56","author":"E Abbe","year":"2010","unstructured":"E Abbe, L Zheng, Linear universal decoding for compound channels. IEEE Trans. Inf. Theory. 56(12), 5999\u20136013 (2010). doi: 10.1109\/TIT.2010.2080910 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/TIFS.2012.2195655","volume":"7","author":"P Meerwald","year":"2012","unstructured":"P Meerwald, T Furon, Toward practical joint decoding of binary Tardos fingerprinting codes. IEEE Trans. Inf. Forensics and Secur. 7(4), 1168\u20131180 (2012). doi: 10.1109\/TIFS.2012.2195655 .","journal-title":"IEEE Trans. Inf. Forensics and Secur"},{"issue":"7","key":"26_CR13","doi-asserted-by":"publisher","first-page":"3882","DOI":"10.1109\/TIT.2015.2428250","volume":"61","author":"B Oosterwijk","year":"2015","unstructured":"B Oosterwijk, J-J Skoric, J Doumen, A capacity-achieving simple decoder for bias-based traitor tracing schemes. IEEE Trans. Inf. Theory. 61(7), 3882\u20133900 (2015). doi: 10.1109\/TIT.2015.2428250 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"A Charpentier, F Xie, C Fontaine, T Furon, in SPIE Media Forensics and Security. Expectation maximization decoding of Tardos probabilistic fingerprinting code, (2009), pp. 1\u201315. doi: 10.1117\/12.806034 .","DOI":"10.1117\/12.806034"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"T Furon, L P\u00e9rez-Freire, in MMSec. EM decoding of Tardos traitor tracing codes, (2009), pp. 99\u2013106. doi: 10.1145\/1597817.1597835 .","DOI":"10.1145\/1597817.1597835"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"T Laarhoven, in WIFS. Dynamic traitor tracing schemes, revisited, (2013), pp. 191\u2013196. doi: 10.1109\/WIFS.2013.6707817 .","DOI":"10.1109\/WIFS.2013.6707817"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"P Meerwald, T Furon, in ICASSP. Group testing meets traitor tracing, (2011), pp. 4204\u20134207. doi: 10.1109\/ICASSP.2011.5947280 .","DOI":"10.1109\/ICASSP.2011.5947280"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0378-3758(85)90022-9","volume":"11","author":"A Sebo\u030b","year":"1985","unstructured":"A Sebo\u030b, On two random search problems. J. Stat. Plan. Infer.11(1), 23\u201331 (1985). doi: 10.1016\/0378-3758(85)90022-9 .","journal-title":"J. Stat. Plan. Infer."},{"issue":"3","key":"26_CR19","first-page":"7","volume":"18","author":"AG D\u2019yachkov","year":"1982","unstructured":"AG D\u2019yachkov, VV Rykov, Bounds on the length of disjunctive codes. Probl. Peredachi Informacii. 18(3), 7\u201313 (1982).","journal-title":"Probl. Peredachi Informacii"},{"issue":"4","key":"26_CR20","first-page":"237","volume":"18","author":"AG D\u2019yachkov","year":"1989","unstructured":"AG D\u2019yachkov, VV Rykov, AM Rashad, Superimposed distance codes. Probl. Control Inf. Theory. 18(4), 237\u2013250 (1989).","journal-title":"Probl. Control Inf. Theory"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1109\/TIT.2011.2178156","volume":"58","author":"V Atia","year":"2012","unstructured":"V Atia, GK Saligrama, Boolean compressed sensing and noisy group testing. IEEE Trans. Inf. Theory. 58(3), 1880\u20131901 (2012). doi: 10.1109\/TIT.2011.2178156 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"26_CR22","doi-asserted-by":"publisher","first-page":"7057","DOI":"10.1109\/TIT.2011.2148691","volume":"57","author":"M Cheraghchi","year":"2011","unstructured":"M Cheraghchi, A Hormati, A Karbasi, M Vetterli, Group testing with probabilistic tests: Theory, design and application. IEEE Trans. Inf. Theory. 57(10), 7057\u20137067 (2011). doi: 10.1109\/TIT.2011.2148691 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"T Laarhoven, in ALLERTON. Efficient probabilistic group testing based on traitor tracing, (2013), pp. 1358\u20131365. doi: 10.1109\/Allerton.2013.6736699 .","DOI":"10.1109\/Allerton.2013.6736699"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"D Sejdinovic, O Johnson, in ALLERTON. Note on noisy group testing: asymptotic bounds and belief propagation reconstruction, (2010), pp. 998\u20131003. doi: 10.1109\/ALLERTON.2010.5707018 .","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"26_CR25","unstructured":"P Moulin, Universal fingerprinting: capacity and random-coding exponents, 1\u201369 (2008). arXiv:0801.3837 [cs.IT]."},{"issue":"9","key":"26_CR26","doi-asserted-by":"publisher","first-page":"1967","DOI":"10.1109\/TIFS.2015.2440190","volume":"10","author":"T Laarhoven","year":"2015","unstructured":"T Laarhoven, Asymptotics of fingerprinting and group testing: tight bounds from channel capacities. IEEE Trans. Inf. Forensics and Secur.10(9), 1967\u20131980 (2015). doi: 10.1109\/TIFS.2015.2440190 .","journal-title":"IEEE Trans. Inf. Forensics and Secur."},{"issue":"694-706","key":"26_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1098\/rsta.1933.0009","volume":"231","author":"J Neyman","year":"1933","unstructured":"J Neyman, ES Pearson, On the problem of the most efficient tests of statistical hypotheses. Philos. Trans. R. Soc. A Math. Phys. Eng. Sci. 231(694-706), 289\u2013337 (1933). doi: 10.1098\/rsta.1933.0009 .","journal-title":"Philos. Trans. R. Soc. A Math. Phys. Eng. Sci"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"L P\u00e9rez-Freire, T Furon, in WIFS. Blind decoder for binary probabilistic traitor tracing codes, (2009), pp. 46\u201350. doi: 10.1109\/WIFS.2009.5386486 .","DOI":"10.1109\/WIFS.2009.5386486"},{"issue":"12","key":"26_CR29","first-page":"1","volume":"1","author":"S Ibrahimi","year":"2014","unstructured":"S Ibrahimi, B Skoric, J-J Oosterwijk, Riding the saddle point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing. EURASIP J. Inf. Secur. 1(12), 1\u201311 (2014). doi: 10.1186\/s13635-014-0012-6 .","journal-title":"EURASIP J. Inf. Secur"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"W Berchtold, M Sch\u00e4fer, in MMSec. Performance and code length optimization of joint decoding Tardos fingerprinting, (2012), pp. 27\u201332. doi: 10.1145\/2361407.2361412 .","DOI":"10.1145\/2361407.2361412"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"M Desoubeaux, C Herzet, W Puech, GL Guelvouit, in MMSP. Enhanced blind decoding of Tardos codes with new MAP-based functions, (2013), pp. 283\u2013288. doi: 10.1109\/MMSP.2013.6659302 .","DOI":"10.1109\/MMSP.2013.6659302"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"T Furon, M Desoubeaux, in WIFS. Tardos codes for real, (2014), pp. 24\u201329. doi: 10.1109\/WIFS.2014.7084298 .","DOI":"10.1109\/WIFS.2014.7084298"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"M Kuribayashi, in IH. Bias equalizer for binary probabilistic fingerprinting codes, (2013), pp. 269\u2013283. doi: 10.1007\/978-3-642-36373-3 .","DOI":"10.1007\/978-3-642-36373-3"},{"issue":"2","key":"26_CR34","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"DR Stinson, T van Trung, R Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Infer. 86(2), 595\u2013617 (2000). doi: 10.1016\/S0378-3758(99)00131-7 .","journal-title":"J. Stat. Plan. Infer"},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"CL Chan, PH Che, S Jaggi, V Saligrama, in ALLERTON. Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms, (2011), pp. 1832\u20131839. doi: 10.1109\/Allerton.2011.6120391 .","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"CL Chan, S Jaggi, V Saligrama, S Agnihotri, in ISIT. Non-adaptive group testing: Explicit bounds and novel algorithms, (2012), pp. 1837\u20131841. doi: 10.1109\/ISIT.2012.6283597 .","DOI":"10.1109\/ISIT.2012.6283597"},{"key":"26_CR37","doi-asserted-by":"crossref","unstructured":"J Oosterwijk, J-J Doumen, T Laarhoven, in SPIE Media Watermarking, Security, and Forensics. Tuple decoders for traitor tracing schemes, (2014), pp. 1\u201321. doi: 10.1117\/12.2037659 .","DOI":"10.1117\/12.2037659"},{"key":"26_CR38","doi-asserted-by":"crossref","unstructured":"D Boesten, B Skoric, in IH. Asymptotic fingerprinting capacity for non-binary alphabets, (2011), pp. 1\u201313. doi: 10.1007\/978-3-642-24178-9_1 .","DOI":"10.1007\/978-3-642-24178-9_1"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Y-W Huang, P Moulin, in ISIT. On fingerprinting capacity games for arbitrary alphabets and their asymptotics, (2012), pp. 2571\u20132575. doi: 10.1109\/ISIT.2012.6283982 .","DOI":"10.1109\/ISIT.2012.6283982"},{"issue":"7","key":"26_CR40","doi-asserted-by":"publisher","first-page":"4230","DOI":"10.1109\/TIT.2013.2251756","volume":"59","author":"T Laarhoven","year":"2013","unstructured":"T Laarhoven, J Doumen, P Roelse, B Skoric, B de Weger, Dynamic Tardos traitor tracing schemes. IEEE Trans. Inf. Theory. 59(7), 4230\u20134242 (2013). doi: 10.1109\/TIT.2013.2251756 .","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["EURASIP Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-015-0026-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13635-015-0026-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-015-0026-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-015-0026-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T04:42:35Z","timestamp":1567485755000},"score":1,"resource":{"primary":{"URL":"https:\/\/jis-eurasipjournals.springeropen.com\/articles\/10.1186\/s13635-015-0026-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,4]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["26"],"URL":"https:\/\/doi.org\/10.1186\/s13635-015-0026-8","relation":{},"ISSN":["1687-417X"],"issn-type":[{"value":"1687-417X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,4]]},"article-number":"3"}}