{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:52:20Z","timestamp":1725537140930},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044304"},{"type":"electronic","value":"9783642044311"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04431-1_13","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T14:32:43Z","timestamp":1251815563000},"page":"176-190","source":"Crossref","is-referenced-by-count":22,"title":["Estimating the Minimal Length of Tardos Code"],"prefix":"10.1007","author":[{"given":"Teddy","family":"Furon","sequence":"first","affiliation":[]},{"given":"Luis","family":"P\u00e9rez-Freire","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"Guyader","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"C\u00e9rou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"116","volume-title":"Proc. of the 35th annual ACM symposium on theory of computing, San Diego, CA, USA","author":"G. Tardos","year":"2003","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. In: Proc. of the 35th annual ACM symposium on theory of computing, San Diego, CA, USA, pp. 116\u2013125. ACM, New York (2003)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Skoric, B., Vladimirova, T., Celik, M., Talstra, J.: Tardos fingerprinting is better than we thought. IEEE Tran. on IT\u00a054 (2008), arXiv:cs\/0607131v1","DOI":"10.1109\/TIT.2008.926307"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10623-008-9200-z","volume":"48","author":"O. Blayer","year":"2008","unstructured":"Blayer, O., Tassa, T.: Improved versions of Tardos\u2019 fingerprinting scheme. Des. Codes Cryptography\u00a048, 79\u2013103 (2008)","journal-title":"Des. Codes Cryptography"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-77224-8_12","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"K. Nuida","year":"2007","unstructured":"Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An improvement of Tardos\u2019s collusion-secure fingerprinting codes with very short lengths. In: Bozta\u015f, S., Lu, H.-F(F.) (eds.) AAECC 2007. LNCS, vol.\u00a04851, pp. 80\u201389. Springer, Heidelberg (2007)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-88961-8_24","volume-title":"Information Hiding","author":"T. Furon","year":"2008","unstructured":"Furon, T., Guyader, A., C\u00e9rou, F.: On the design and optimization of Tardos probabilistic fingerprinting codes. In: Solanki, K., Sullivan, K., Madhow, U. (eds.) IH 2008. LNCS, vol.\u00a05284, pp. 341\u2013356. Springer, Heidelberg (2008)"},{"key":"13_CR6","unstructured":"Moulin, P.: Universal fingerprinting: capacity and random-coding exponents. IEEE Transactions on Information Theory (2008) (submitted), http:\/\/arxiv.org\/abs\/0801.3837"},{"key":"13_CR7","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, 1897\u20131905 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10623-007-9142-x","volume":"46","author":"B. Skoric","year":"2008","unstructured":"Skoric, B., Katzenbeisser, S., Celik, M.: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. Designs, Codes and Cryptography\u00a046, 137\u2013166 (2008)","journal-title":"Designs, Codes and Cryptography"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley series in Telecommunications (1991)","DOI":"10.1002\/0471200611"},{"key":"13_CR10","first-page":"45","volume":"20","author":"A. Lagnoux","year":"2006","unstructured":"Lagnoux, A.: Rare event simulation. PEIS\u00a020, 45\u201366 (2006)","journal-title":"PEIS"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"C\u00e9rou, F., Furon, T., Guyader, A.: Experimental assessment of the reliability for watermarking and fingerprinting schemes. Accepted to EURASIP Jounal on Information Security (2009)","DOI":"10.1155\/2008\/414962"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04431-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T09:23:25Z","timestamp":1558517005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04431-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044304","9783642044311"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04431-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}