{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:36Z","timestamp":1750306236094,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T00:00:00Z","timestamp":1466380800000},"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":[[2016,6,20]]},"DOI":"10.1145\/2909827.2930792","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:57:38Z","timestamp":1465567058000},"page":"51-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Group Testing for Identification with Privacy"],"prefix":"10.1145","author":[{"given":"Ahmet","family":"Iscen","sequence":"first","affiliation":[{"name":"Inria, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teddy","family":"Furon","sequence":"additional","affiliation":[{"name":"Inria, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600918.2600922"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-642-41320-9_11","volume-title":"Financial Cryptography and Data Security","author":"Bringer J.","year":"2013","unstructured":"J. Bringer , H. Chabanne , and A. Patey . SHADE: secure hamming distance computation from oblivious transfer . In Financial Cryptography and Data Security , volume 7862 of Lecture Notes in Computer Science , pages 164 -- 176 , 2013 . J. Bringer, H. Chabanne, and A. Patey. SHADE: secure hamming distance computation from oblivious transfer. In Financial Cryptography and Data Security, volume 7862 of Lecture Notes in Computer Science, pages 164--176, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2437652"},{"key":"e_1_3_2_1_6_1","volume-title":"Memory vectors for similarity search in high-dimensional spaces. CoRR, abs\/1412.3328","author":"Iscen A.","year":"2014","unstructured":"A. Iscen , T. Furon , V. Gripon , M. G. Rabbat , and H. J\u00e9gou . Memory vectors for similarity search in high-dimensional spaces. CoRR, abs\/1412.3328 , 2014 . A. Iscen, T. Furon, V. Gripon, M. G. Rabbat, and H. J\u00e9gou. Memory vectors for similarity search in high-dimensional spaces. CoRR, abs\/1412.3328, 2014."},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient Large-Scale Similarity Search Using Matrix Factorization. In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas","author":"Iscen A.","year":"2016","unstructured":"A. Iscen , M. Rabbat , and T. Furon . Efficient Large-Scale Similarity Search Using Matrix Factorization. In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas , United States , June 2016 . A. Iscen, M. Rabbat, and T. Furon. Efficient Large-Scale Similarity Search Using Matrix Factorization. In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, United States, June 2016."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_1_9_1","volume-title":"Fisher Vector Faces in the Wild. In British Machine Vision Conference","author":"Simonyan K.","year":"2013","unstructured":"K. Simonyan , O. M. Parkhi , A. Vedaldi , and A. Zisserman . Fisher Vector Faces in the Wild. In British Machine Vision Conference , 2013 . K. Simonyan, O. M. Parkhi, A. Vedaldi, and A. Zisserman. Fisher Vector Faces in the Wild. In British Machine Vision Conference, 2013."},{"key":"e_1_3_2_1_10_1","volume-title":"Department of Engineering Science","author":"Simonyan K.","year":"2013","unstructured":"K. Simonyan , A. Vedaldi , and A. Zisserman . Learning local feature descriptors using convex optimisation. Technical report , Department of Engineering Science , University of Oxford , 2013 . K. Simonyan, A. Vedaldi, and A. Zisserman. Learning local feature descriptors using convex optimisation. Technical report, Department of Engineering Science, University of Oxford, 2013."},{"key":"e_1_3_2_1_11_1","volume-title":"NIPS","author":"Weiss Y.","year":"2009","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In NIPS , December 2009 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, December 2009."}],"event":{"name":"IH&MMSec '16: ACM Information Hiding and Multimedia Security Workshop","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Vigo Galicia Spain","acronym":"IH&MMSec '16"},"container-title":["Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2909827.2930792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2909827.2930792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:23Z","timestamp":1750220603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2909827.2930792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,20]]},"references-count":10,"alternative-id":["10.1145\/2909827.2930792","10.1145\/2909827"],"URL":"https:\/\/doi.org\/10.1145\/2909827.2930792","relation":{},"subject":[],"published":{"date-parts":[[2016,6,20]]},"assertion":[{"value":"2016-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}