{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:46:49Z","timestamp":1780634809818,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,4]]},"DOI":"10.1145\/1866870.1866873","type":"proceedings-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T15:38:31Z","timestamp":1286897911000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Robust fingerprinting codes"],"prefix":"10.1145","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[{"name":"University of Athens, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hart William","family":"Montgomery","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford , CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496808"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of SODA '00","author":"Berkman O.","year":"2000","unstructured":"}} O. Berkman , M. Parnas , and J. Sgall . Efficient dynamic traitor tracing . In Proceedings of SODA '00 , 2000 . }}O. Berkman, M. Parnas, and J. Sgall. Efficient dynamic traitor tracing. In Proceedings of SODA '00, 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_17"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9200-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703972"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455834"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180432"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_32"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705834"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841169"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/648120.747059"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"71","volume-title":"Proceedings of ISC'07","author":"Fazio N.","year":"2007","unstructured":"}} N. Fazio , A. Nicolosi , and D. Phan . Traitor tracing with optimal transmission rate . In Proceedings of ISC'07 , volume 4779 of LNCS , pages 71 -- 88 . springer, 2007 . }}N. Fazio, A. Nicolosi, and D. Phan. Traitor tracing with optimal transmission rate. In Proceedings of ISC'07, volume 4779 of LNCS, pages 71--88. springer, 2007."},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"354","volume-title":"Proceedings of Crypto '99","author":"Fiat Amos","year":"1999","unstructured":"}} Amos Fiat and T. Tassa . Dynamic traitor tracing . In Proceedings of Crypto '99 , volume 1666 of LNCS , pages 354 -- 371 , 1999 . }}Amos Fiat and T. Tassa. Dynamic traitor tracing. In Proceedings of Crypto '99, volume 1666 of LNCS, pages 354--371, 1999."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.759592"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"134","volume-title":"Information Hiding '99","author":"Guth H.","year":"1999","unstructured":"}} H. Guth and B. Pfitzmann . Error- and collusion-secure fingerprinting for digital data . In Information Hiding '99 , volume 1768 of LNCS , pages 134 -- 145 , 1999 . }}H. Guth and B. Pfitzmann. Error- and collusion-secure fingerprinting for digital data. In Information Hiding '99, volume 1768 of LNCS, pages 134--145, 1999."},{"key":"e_1_3_2_1_18_1","unstructured":"}}Jon Johansen. DeCSS 1999. http:\/\/en.wikipedia.org\/wiki\/DeCSS.  }}Jon Johansen. DeCSS 1999. http:\/\/en.wikipedia.org\/wiki\/DeCSS."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647087.715840"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187441.1187444"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054123"},{"key":"e_1_3_2_1_23_1","volume-title":"E85-A(2):481--484","author":"Mitsunari Shigeo","year":"2002","unstructured":"}} Shigeo Mitsunari , Ryuichi Sakai , and Masao Kasahara . A new traitor tracing. IEICE Trans. Fundamentals , E85-A(2):481--484 , 2002 . }}Shigeo Mitsunari, Ryuichi Sakai, and Masao Kasahara. A new traitor tracing. IEICE Trans. Fundamentals, E85-A(2):481--484, 2002."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704277"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706334"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/647504.728500"},{"key":"e_1_3_2_1_27_1","volume-title":"ICITS 2009","author":"Nuida Koji","year":"2009","unstructured":"}} Koji Nuida . A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure . In ICITS 2009 , 2009 . }}Koji Nuida. A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure. In ICITS 2009, 2009."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781734.1781748"},{"key":"e_1_3_2_1_29_1","first-page":"472","volume-title":"SODA 2003","author":"Peikert Chris","year":"2003","unstructured":"}} Chris Peikert , Abhi Shelat , and Adam Smith . Lower bounds for collusion-secure fingerprinting . In SODA 2003 , pages 472 -- 479 , 2003 . }}Chris Peikert, Abhi Shelat, and Adam Smith. Lower bounds for collusion-secure fingerprinting. In SODA 2003, pages 472--479, 2003."},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"316","volume-title":"Proceedings of Crypto '00","author":"Safavi-Naini Reihaneh","year":"2000","unstructured":"}} Reihaneh Safavi-Naini and Yejing Wang . Sequential traitor tracing . In Proceedings of Crypto '00 , volume 1880 of LNCS , pages 316 -- 332 , 2000 . }}Reihaneh Safavi-Naini and Yejing Wang. Sequential traitor tracing. In Proceedings of Crypto '00, volume 1880 of LNCS, pages 316--332, 2000."},{"key":"e_1_3_2_1_31_1","series-title":"LNCS","first-page":"175","volume-title":"Proceedings of ASIACRYPT '01","author":"Silverberg Alice","year":"2001","unstructured":"}} Alice Silverberg , Jessica Staddon , and Judy L. Walker . Efficient traitor tracing algorithms using list decoding . In Proceedings of ASIACRYPT '01 , volume 2248 of LNCS , pages 175 -- 192 , 2001 . }}Alice Silverberg, Jessica Staddon, and Judy L. Walker. Efficient traitor tracing algorithms using list decoding. In Proceedings of ASIACRYPT '01, volume 2248 of LNCS, pages 175--192, 2001."},{"key":"e_1_3_2_1_32_1","volume-title":"Workshop on Coding and Cryptography","author":"Sirvent T.","year":"2007","unstructured":"}} T. Sirvent . Traitor tracing scheme with constant ciphertext rate against powerful pirates . In Workshop on Coding and Cryptography , 2007 . }}T. Sirvent. Traitor tracing scheme with constant ciphertext rate against powerful pirates. In Workshop on Coding and Cryptography, 2007."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9142-x"},{"key":"e_1_3_2_1_34_1","volume-title":"Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000\/004","author":"Staddon Jessica N.","year":"2000","unstructured":"}} Jessica N. Staddon , Douglas R. Stinson , and Ruizhong Wei . Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000\/004 , 2000 . }}Jessica N. Staddon, Douglas R. Stinson, and Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000\/004, 2000."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196304246"},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","volume-title":"Proceedings of SAC '98","author":"Stinson D.","year":"1998","unstructured":"}} D. Stinson and R. Wei . Key preassigned traceability schemes for broadcast encryption . In Proceedings of SAC '98 , volume 1556 of LNCS , 1998 . }}D. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC '98, volume 1556 of LNCS, 1998."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780561"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0214-z"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/947380.947389"}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","location":"Chicago Illinois USA","acronym":"CCS '10","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the tenth annual ACM workshop on Digital rights management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866870.1866873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866870.1866873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:59Z","timestamp":1750243979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866870.1866873"}},"subtitle":["a near optimal construction"],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":39,"alternative-id":["10.1145\/1866870.1866873","10.1145\/1866870"],"URL":"https:\/\/doi.org\/10.1145\/1866870.1866873","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}