{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T05:30:06Z","timestamp":1688967006201},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/tifs.2011.2116783","type":"journal-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T17:44:47Z","timestamp":1298051087000},"page":"906-919","source":"Crossref","is-referenced-by-count":23,"title":["Tardos Fingerprinting Codes in the Combined Digit Model"],"prefix":"10.1109","volume":"6","author":[{"given":"Boris","family":"Skoric","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Georg","family":"Schaathun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Utku","family":"Celik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature","volume":"abs cs 610036","author":"nuida","year":"2006","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/10719724_10","volume":"1768","author":"guth","year":"1999","journal-title":"Information Hiding"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/803217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708876"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842702"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594980"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205882"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/597040"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-0-387-35612-9_15","volume":"228","author":"steinebach","year":"2002","journal-title":"Communications and Multimedia Security"},{"key":"ref19","author":"schaathun","year":"2008","journal-title":"Multimedia Communication Security Recent Advances"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-007-0096-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2006.873597"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10623-007-9142-x","article-title":"Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes","volume":"46","author":"kori","year":"2008","journal-title":"Designs Codes Cryptography"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1411328.1411347"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9200-z"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-3-540-88961-8_24","author":"furon","year":"2008","journal-title":"Information Hiding"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/780559.780561"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"ref9","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":"kori","year":"2008","journal-title":"IEEE Trans Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.846035"},{"key":"ref21","author":"simone","year":"2010","journal-title":"Accusation Probabilities in Tardos Codes The Gaussian Approximation is Better Than We Thought"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10206\/5983314\/05715876.pdf?arnumber=5715876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:46Z","timestamp":1633910026000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5715876\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":21,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2011.2116783","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}