{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:47:15Z","timestamp":1768016835719,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["SEC-2011-284862"],"award-info":[{"award-number":["SEC-2011-284862"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,11]]},"DOI":"10.1145\/2600918.2600922","type":"proceedings-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:50:25Z","timestamp":1402404625000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["GSHADE"],"prefix":"10.1145","author":[{"given":"Julien","family":"Bringer","sequence":"first","affiliation":[{"name":"Morpho, Osny, France"}]},{"given":"Herve","family":"Chabanne","sequence":"additional","affiliation":[{"name":"Morpho, Telecom ParisTech, Osny, Paris, France"}]},{"given":"Melanie","family":"Favre","sequence":"additional","affiliation":[{"name":"Morpho, Osny, France"}]},{"given":"Alain","family":"Patey","sequence":"additional","affiliation":[{"name":"Morpho, Telecom ParisTech, Osny, Paris, France"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Michael","family":"Zohner","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_2_1","unstructured":"AT&T Laboratories Cambridge. The database of faces. http:\/\/www.cl.cam.ac.uk\/research\/dtg\/attarchive\/facedatabase.html.  AT&T Laboratories Cambridge. The database of faces. http:\/\/www.cl.cam.ac.uk\/research\/dtg\/attarchive\/facedatabase.html."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854229.1854270"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645309.648965"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041225.2041240"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-32946-3_5","volume-title":"Financial Cryptography (FC)","author":"Bogdanov D.","year":"2012","unstructured":"D. Bogdanov , R. Talviste , and J. Willemson . Deploying secure multi-party computation for financial data analysis . In Financial Cryptography (FC) , volume 7397 of LNCS , pages 57 -- 64 . Springer , 2012 . D. Bogdanov, R. Talviste, and J. Willemson. Deploying secure multi-party computation for financial data analysis. In Financial Cryptography (FC), volume 7397 of LNCS, pages 57--64. Springer, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230218"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41320-9_11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICB.2012.6199817"},{"key":"e_1_3_2_1_11_1","unstructured":"Carnegie Mellon University. The CMU Multi-PIE face database. http:\/\/www.multipie.org.  Carnegie Mellon University. The CMU Multi-PIE face database. http:\/\/www.multipie.org."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"280","volume-title":"EUROCRYPT","author":"Cramer R.","year":"2001","unstructured":"R. Cramer , I. Damg\u00e5rd , and J. B. Nielsen . Multiparty computation from threshold homomorphic encryption . In EUROCRYPT , volume 2045 of LNCS , pages 280 -- 300 . Springer , 2001 . R. Cramer, I. Damg\u00e5rd, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT, volume 2045 of LNCS, pages 280--300. Springer, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770231.1770269"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2003.818350"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"e_1_3_2_1_19_1","first-page":"205","volume-title":"CRYPTO","author":"Even S.","year":"1982","unstructured":"S. Even , O. Goldreich , and A. Lempel . A randomized protocol for signing contracts . In CRYPTO , pages 205 -- 210 . Springer , 1982 . S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In CRYPTO, pages 205--210. Springer, 1982."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2009.08.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33885-4_55"},{"key":"e_1_3_2_1_24_1","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography","author":"Hazay C.","year":"2010","unstructured":"C. Hazay and Y. Lindell . Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography . Springer , 2010 . C. Hazay and Y. Lindell. Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography. Springer, 2010."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_26_1","volume-title":"Network and Distributed System Security Symposium (NDSS). The Internet Society","author":"Huang Y.","year":"2012","unstructured":"Y. Huang , D. Evans , and J. Katz . Private set intersection: Are garbled circuits better than custom protocols? In Network and Distributed System Security Symposium (NDSS). The Internet Society , 2012 . Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In Network and Distributed System Security Symposium (NDSS). The Internet Society, 2012."},{"key":"e_1_3_2_1_27_1","volume-title":"USENIX Security Symposium. USENIX Association","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , and L. Malka . Faster secure two-party computation using garbled circuits . In USENIX Security Symposium. USENIX Association , 2011 . Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium. USENIX Association, 2011."},{"key":"e_1_3_2_1_28_1","volume-title":"Network and Distributed System Security Symposium (NDSS). The Internet Society","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , L. Malka , D. Evans , and J. Katz . Efficient privacy-preserving biometric identification . In Network and Distributed System Security Symposium (NDSS). The Internet Society , 2011 . Y. Huang, L. Malka, D. Evans, and J. Katz. Efficient privacy-preserving biometric identification. In Network and Distributed System Security Symposium (NDSS). The Internet Society, 2011."},{"key":"e_1_3_2_1_29_1","unstructured":"Idiap Research Institute. Face recognition library. https:\/\/pypi.python.org\/pypi\/facereclib.  Idiap Research Institute. Face recognition library. https:\/\/pypi.python.org\/pypi\/facereclib."},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"145","volume-title":"CRYPTO","author":"Ishai Y.","year":"2003","unstructured":"Y. Ishai , J. Kilian , K. Nissim , and E. Petrank . Extending oblivious transfers efficiently . In CRYPTO , volume 2729 of LNCS , pages 145 -- 161 . Springer , 2003 . Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO, volume 2729 of LNCS, pages 145--161. Springer, 2003."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.784628"},{"key":"e_1_3_2_1_32_1","series-title":"LNCS","first-page":"54","volume-title":"CRYPTO","author":"Kolesnikov V.","year":"2013","unstructured":"V. Kolesnikov and R. Kumaresan . Improved OT extension for transferring short secrets . In CRYPTO , volume 8043 of LNCS , pages 54 -- 70 . Springer , 2013 . V. Kolesnikov and R. Kumaresan. Improved OT extension for transferring short secrets. In CRYPTO, volume 8043 of LNCS, pages 54--70. Springer, 2013."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1795765"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467444"},{"key":"e_1_3_2_1_36_1","first-page":"448","volume-title":"Symposium On Discrete Algorithms (SODA)","author":"Naor M.","year":"2001","unstructured":"M. Naor and B. Pinkas . Efficient oblivious transfer protocols . In Symposium On Discrete Algorithms (SODA) , pages 448 -- 457 . ACM\/SIAM, 2001 . M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Symposium On Discrete Algorithms (SODA), pages 448--457. ACM\/SIAM, 2001."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.39"},{"key":"e_1_3_2_1_39_1","series-title":"LNCS","first-page":"223","volume-title":"EUROCRYPT","author":"Paillier P.","year":"1999","unstructured":"P. Paillier . Public-key cryptosystems based on composite degree residuosity classes . In EUROCRYPT , volume 1592 of LNCS , pages 223 -- 238 . Springer , 1999 . P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, volume 1592 of LNCS, pages 223--238. Springer, 1999."},{"key":"e_1_3_2_1_40_1","volume-title":"TR-81 edition","author":"Rabin M. O.","year":"1981","unstructured":"M. O. Rabin . How to exchange secrets with oblivious transfer , TR-81 edition , 1981 . Aiken Computation Lab, Harvard University . M. O. Rabin. How to exchange secrets with oblivious transfer, TR-81 edition, 1981. Aiken Computation Lab, Harvard University."},{"key":"e_1_3_2_1_41_1","first-page":"229","volume-title":"International Conference on Information Security and Cryptology (ICISC)","volume":"5984","author":"Sadeghi A.-R.","year":"2009","unstructured":"A.-R. Sadeghi , T. Schneider , and I. Wehrenberg . Efficient privacy-preserving face recognition . In International Conference on Information Security and Cryptology (ICISC) , volume 5984 of LNCS, pages 229 -- 244 . Springer , 2009 . A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Efficient privacy-preserving face recognition. In International Conference on Information Security and Cryptology (ICISC), volume 5984 of LNCS, pages 229--244. Springer, 2009."},{"key":"e_1_3_2_1_42_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-39884-1_23","volume-title":"Financial Cryptography (FC)","author":"Schneider T.","year":"2013","unstructured":"T. Schneider and M. Zohner . GMW vs. Yao? Efficient secure two-party computation with low depth circuits . In Financial Cryptography (FC) , volume 7859 of LNCS , pages 275 -- 292 . Springer , 2013 . T. Schneider and M. Zohner. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In Financial Cryptography (FC), volume 7859 of LNCS, pages 275--292. Springer, 2013."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31448-3_32"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"IH&MMSec '14: ACM Information Hiding and Multimedia Security Workshop","location":"Salzburg Austria","acronym":"IH&MMSec '14","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 2nd ACM workshop on Information hiding and multimedia security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600918.2600922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600918.2600922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:38Z","timestamp":1750278158000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600918.2600922"}},"subtitle":["faster privacy-preserving distance computation and biometric identification"],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":45,"alternative-id":["10.1145\/2600918.2600922","10.1145\/2600918"],"URL":"https:\/\/doi.org\/10.1145\/2600918.2600922","relation":{},"subject":[],"published":{"date-parts":[[2014,6,11]]},"assertion":[{"value":"2014-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}