{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:36Z","timestamp":1750220616162,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"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":[[2020,10,15]]},"DOI":"10.1145\/3383455.3422569","type":"proceedings-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T14:51:48Z","timestamp":1633618308000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["SecretMatch"],"prefix":"10.1145","author":[{"given":"Tucker","family":"Balch","sequence":"first","affiliation":[{"name":"J.P. Morgan AI Research"}]},{"given":"Benjamin E.","family":"Diamond","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research"}]}],"member":"320","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2020. PALISADE Lattice Cryptography Library (release 1.9.2). https:\/\/palisade-crypto.org\/.  2020. PALISADE Lattice Cryptography Library (release 1.9.2). https:\/\/palisade-crypto.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Gilad Asharov Tucker Balch Antigoni Polychroniadou and Manuela Veloso. 2020. Privacy Preserving Dark Pool. In AAMAS.  Gilad Asharov Tucker Balch Antigoni Polychroniadou and Manuela Veloso. 2020. Privacy Preserving Dark Pool. In AAMAS ."},{"key":"e_1_3_2_1_3_1","unstructured":"Pascal Aubry Sergiu Carpov Paul Dubrulle Simon Fau Vincent Herbert Malika Izabach\u00e8ne Thanh-Hai Nguyen Donald Nokam-Kaute Patrick Ruf Kalpana Singl Oana Stan and Renaud Sirdey. 2017. Cingulata. https:\/\/github.com\/CEA-LIST\/Cingulata.  Pascal Aubry Sergiu Carpov Paul Dubrulle Simon Fau Vincent Herbert Malika Izabach\u00e8ne Thanh-Hai Nguyen Donald Nokam-Kaute Patrick Ruf Kalpana Singl Oana Stan and Renaud Sirdey. 2017. Cingulata. https:\/\/github.com\/CEA-LIST\/Cingulata."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4 , 1988, Chicago, Illinois, USA. 1--10. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA. 1--10."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329809"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_8_1","volume-title":"TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/.","author":"Chillotti Ilaria","year":"2019","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . 2019 . TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2019. TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/."},{"volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","key":"e_1_3_2_1_9_1","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms ( third ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (third ed.). The MIT Press."},{"volume-title":"Cryptography and Information Security in the Balkans, Enes Pasalic and Lars R","author":"Dai Wei","key":"e_1_3_2_1_10_1","unstructured":"Wei Dai and Berk Sunar . 2016. cuHE: A Homomorphic Encryption Accelerator Library . In Cryptography and Information Security in the Balkans, Enes Pasalic and Lars R . Knudsen (Eds.). Springer International Publishing , Cham , 169--186. Wei Dai and Berk Sunar. 2016. cuHE: A Homomorphic Encryption Accelerator Library. In Cryptography and Information Security in the Balkans, Enes Pasalic and Lars R. Knudsen (Eds.). Springer International Publishing, Cham, 169--186."},{"key":"e_1_3_2_1_11_1","volume-title":"Somewhat Practical Fully Homomorphic Encryption. (March","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren . 2012. Somewhat Practical Fully Homomorphic Encryption. (March 2012 ). Unpublished manuscript. Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. (March 2012). Unpublished manuscript."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_13_1","volume-title":"Asymptotically-Faster, Attribute-Based. In Advances in Cryptology - CRYPTO","author":"Gentry Craig","year":"2013","unstructured":"Craig Gentry , Amit Sahai , and Brent Waters . 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler , Asymptotically-Faster, Attribute-Based. In Advances in Cryptology - CRYPTO 2013 , Ran Canetti and Juan A. Garay (Eds.). Springer Berlin Heidelberg , 75--92. Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In Advances in Cryptology - CRYPTO 2013, Ran Canetti and Juan A. Garay (Eds.). Springer Berlin Heidelberg, 75--92."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich , Silvio Micali , and Avi Wigderson . 1987 . How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority . In Proceedings of the 19th Annual ACM Symposium on Theory of Computing , 1987, New York, New York, USA. 218--229. Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. 218--229."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1292373"},{"key":"e_1_3_2_1_16_1","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1982","unstructured":"Andrew Chi-Chih Yao . 1982 . Protocols for Secure Computations (Extended Abstract) . In 23rd Annual Symposium on Foundations of Computer Science , Chicago, Illinois, USA, 3- -5 November 1982. 160--164. Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3--5 November 1982. 160--164."}],"event":{"name":"ICAIF '20: ACM International Conference on AI in Finance","sponsor":["ACM Association for Computing Machinery"],"location":"New York New York","acronym":"ICAIF '20"},"container-title":["Proceedings of the First ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383455.3422569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3383455.3422569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:10Z","timestamp":1750197670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383455.3422569"}},"subtitle":["inventory matching from fully homomorphic encryption"],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":16,"alternative-id":["10.1145\/3383455.3422569","10.1145\/3383455"],"URL":"https:\/\/doi.org\/10.1145\/3383455.3422569","relation":{},"subject":[],"published":{"date-parts":[[2020,10,15]]},"assertion":[{"value":"2021-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}