{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:15:24Z","timestamp":1729678524927,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/wifs.2012.6412656","type":"proceedings-article","created":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T14:44:59Z","timestamp":1359125099000},"page":"240-245","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic traitor tracing for arbitrary alphabets: Divide and conquer"],"prefix":"10.1109","author":[{"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[]},{"given":"Jan-Jaap","family":"Oosterwijk","sequence":"additional","affiliation":[]},{"given":"Jeroen","family":"Doumen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/780559.780561"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0214-z"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9142-x"},{"key":"14","doi-asserted-by":"crossref","first-page":"3663","DOI":"10.1109\/TIT.2008.926307","article-title":"Tardos Fingerprinting is Better Than We Thought","volume":"54","author":"s?koric?","year":"2008","journal-title":"IEEE Trans Inform Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251756"},{"key":"12","first-page":"159","article-title":"Balls into Bins\" - A Simple and Tight Analysis","author":"raab","year":"0","journal-title":"Proc RANDOM 1998"},{"key":"3","article-title":"Asymptotic Fingerprinting Capacity for Non-Binary Alphabets","author":"boesten","year":"0","journal-title":"Proc 13th Information Hiding Conf 2011"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9200-z"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700367984"},{"key":"10","article-title":"Optimal Symmetric Tardos Traitor Tracing Schemes","author":"laarhoven","year":"2012","journal-title":"Des Codes Cryptogr"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0006-7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2168212"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283982"}],"event":{"name":"2012 IEEE International Workshop on Information Forensics and Security (WIFS)","start":{"date-parts":[[2012,12,2]]},"location":"Costa Adeje - Tenerife, Spain","end":{"date-parts":[[2012,12,5]]}},"container-title":["2012 IEEE International Workshop on Information Forensics and Security (WIFS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6395850\/6412607\/06412656.pdf?arnumber=6412656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T02:24:45Z","timestamp":1498011885000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6412656\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/wifs.2012.6412656","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}