{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:46:00Z","timestamp":1773125160947,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["016.Veni.192.005"],"award-info":[{"award-number":["016.Veni.192.005"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,2]]},"DOI":"10.1145\/3335203.3335732","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"182-187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Nearest Neighbor Decoding for Tardos Fingerprinting Codes"],"prefix":"10.1145","author":[{"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ehsan Amiri and G\u00e1bor Tardos. 2009. High Rate Fingerprinting Codes and the Fingerprinting Capacity. In SODA. 336--345. http:\/\/dl.acm.org\/citation.cfm?id= 1496808 Ehsan Amiri and G\u00e1bor Tardos. 2009. High Rate Fingerprinting Codes and the Fingerprinting Capacity. In SODA. 336--345. http:\/\/dl.acm.org\/citation.cfm?id= 1496808","DOI":"10.1137\/1.9781611973068.38"},{"key":"e_1_3_2_1_3_1","unstructured":"Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya Razenshteyn and Ludwig Schmidt. 2015. Practical and Optimal LSH for Angular Distance. In NIPS. 1225--1233. https:\/\/papers.nips.cc\/paper\/ 5893-practical-and-optimal-lsh-for-angular-distance Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya Razenshteyn and Ludwig Schmidt. 2015. Practical and Optimal LSH for Angular Distance. In NIPS. 1225--1233. https:\/\/papers.nips.cc\/paper\/ 5893-practical-and-optimal-lsh-for-angular-distance"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Alexandr Andoni Thijs Laarhoven Ilya Razenshteyn and Erik Waingarten. 2017. Optimal hashing-based time-space trade-offs for approximate near neighbors. In SODA. 47--66. Alexandr Andoni Thijs Laarhoven Ilya Razenshteyn and Erik Waingarten. 2017. Optimal hashing-based time-space trade-offs for approximate near neighbors. In SODA. 47--66.","DOI":"10.1137\/1.9781611974782.4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Martin Aumueller Erik Bernhardsson and Alexander Faithfull. 2017. ANNBenchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms. In SISAP. 34--49. Martin Aumueller Erik Bernhardsson and Alexander Faithfull. 2017. ANNBenchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms. In SISAP. 34--49.","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Anja Becker L\u00e9o Ducas Nicolas Gama and Thijs Laarhoven. 2016. New directions in nearest neighbor searching with applications to lattice sieving. In SODA. 10--24. Anja Becker L\u00e9o Ducas Nicolas Gama and Thijs Laarhoven. 2016. New directions in nearest neighbor searching with applications to lattice sieving. In SODA. 10--24.","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2361407.2361412"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9200-z"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Ana Charpentier Fuchun Xie Caroline Fontaine and Teddy Furon. 2009. Expectation Maximization Decoding of Tardos Probabilistic Fingerprinting Code. In SPIE Media Forensics and Security. 1--15. Ana Charpentier Fuchun Xie Caroline Fontaine and Teddy Furon. 2009. Expectation Maximization Decoding of Tardos Probabilistic Fingerprinting Code. In SPIE Media Forensics and Security. 1--15.","DOI":"10.1117\/12.806034"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Mathieu Desoubeaux C\u00e9dric Herzet William Puech and Ga\u00ebtan Le Guelvouit. 2013. Enhanced Blind Decoding of Tardos Codes with New MAP-Based Functions. In MMSP. 283--288. Mathieu Desoubeaux C\u00e9dric Herzet William Puech and Ga\u00ebtan Le Guelvouit. 2013. Enhanced Blind Decoding of Tardos Codes with New MAP-Based Functions. In MMSP. 283--288.","DOI":"10.1109\/MMSP.2013.6659302"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Tamir Tassa. 1999. Dynamic Traitor Tracing. In CRYPTO. 354--371. Amos Fiat and Tamir Tassa. 1999. Dynamic Traitor Tracing. In CRYPTO. 354--371.","DOI":"10.1007\/3-540-48405-1_23"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Teddy Furon and Mathieu Desoubeaux. 2014. Tardos Codes for Real. In WIFS. 24--29. Teddy Furon and Mathieu Desoubeaux. 2014. Tardos Codes for Real. In WIFS. 24--29.","DOI":"10.1109\/WIFS.2014.7084298"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Teddy Furon Arnaud Guyader and Fr\u00e9d\u00e9ric C\u00e9rou. 2008. On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes. In IH. 341--356. Teddy Furon Arnaud Guyader and Fr\u00e9d\u00e9ric C\u00e9rou. 2008. On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes. In IH. 341--356.","DOI":"10.1007\/978-3-540-88961-8_24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Teddy Furon Arnaud Guyader and Fr\u00e9d\u00e9ric C\u00e9rou. 2012. Decoding fingerprints using the Markov Chain Monte Carlo method. In WIFS. 187--192. Teddy Furon Arnaud Guyader and Fr\u00e9d\u00e9ric C\u00e9rou. 2012. Decoding fingerprints using the Markov Chain Monte Carlo method. In WIFS. 187--192.","DOI":"10.1109\/WIFS.2012.6412647"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1597817.1597835"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Teddy Furon and Luis P\u00e9rez-Freire. 2009. Worst Case Attacks Against Binary Probabilistic Traitor Tracing Codes. In WIFS. 56--60. Teddy Furon and Luis P\u00e9rez-Freire. 2009. Worst Case Attacks Against Binary Probabilistic Traitor Tracing Codes. In WIFS. 56--60.","DOI":"10.1109\/WIFS.2009.5386484"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600918.2600925"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2756601.2756603"},{"key":"e_1_3_2_1_22_1","unstructured":"Thijs Laarhoven. 2016. Search problems in cryptography. Ph.D. Dissertation. Eindhoven University of Technology. http:\/\/repository.tue.nl\/837539 Thijs Laarhoven. 2016. Search problems in cryptography. Ph.D. Dissertation. Eindhoven University of Technology. http:\/\/repository.tue.nl\/837539"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482513.2482533"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251756"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Yan-Nei Law and Carlo Zaniolo. 2005. An Adaptive Nearest Neighbor Classification Algorithm for Data Streams. In PKDD Al\u00edpio M\u00e1rio Jorge Lu\u00eds Torgo Pavel Brazdil Rui Camacho and Jo\u00e3o Gama (Eds.). Springer Berlin Heidelberg 108--120. Yan-Nei Law and Carlo Zaniolo. 2005. An Adaptive Nearest Neighbor Classification Algorithm for Data Streams. In PKDD Al\u00edpio M\u00e1rio Jorge Lu\u00eds Torgo Pavel Brazdil Rui Camacho and Jo\u00e3o Gama (Eds.). Springer Berlin Heidelberg 108--120.","DOI":"10.1007\/11564126_15"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Peter Meerwald and Teddy Furon. 2011. Group Testing Meets Traitor Tracing. In ICASSP. 4204--4207. Peter Meerwald and Teddy Furon. 2011. Group Testing Meets Traitor Tracing. In ICASSP. 4204--4207.","DOI":"10.1109\/ICASSP.2011.5947280"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2195655"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9285-z"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482513.2482527"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2428250"},{"key":"e_1_3_2_1_31_1","unstructured":"Rasmus Pagh. 2016. Locality-sensitive hashing without false negatives. In SODA. 1--9. http:\/\/arxiv.org\/abs\/1507.03225 Rasmus Pagh. 2016. Locality-sensitive hashing without false negatives. In SODA. 1--9. http:\/\/arxiv.org\/abs\/1507.03225"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Rina Panigrahy. 2006. Entropy based nearest neighbor search in high dimensions. In SODA. 1186--1195. http:\/\/dl.acm.org\/citation.cfm?id=1109688 Rina Panigrahy. 2006. Entropy based nearest neighbor search in high dimensions. In SODA. 1186--1195. http:\/\/dl.acm.org\/citation.cfm?id=1109688","DOI":"10.1145\/1109557.1109688"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2403575"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9142-x"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9842-3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926307"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780561"}],"event":{"name":"IH&MMSec '19: ACM Information Hiding and Multimedia Security Workshop","location":"Paris France","acronym":"IH&MMSec '19","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the ACM Workshop on Information Hiding and Multimedia Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335203.3335732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3335203.3335732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:18Z","timestamp":1750206378000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335203.3335732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":37,"alternative-id":["10.1145\/3335203.3335732","10.1145\/3335203"],"URL":"https:\/\/doi.org\/10.1145\/3335203.3335732","relation":{},"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2019-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}