{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T17:17:30Z","timestamp":1784395050273,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T00:00:00Z","timestamp":1635897600000},"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":[[2021,11,3]]},"DOI":"10.1145\/3490354.3494400","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T03:50:06Z","timestamp":1651722606000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-preserving portfolio pricing"],"prefix":"10.1145","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[{"name":"J.P. Morgan AI Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tucker","family":"Balch","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1749","article-title":"From Keys to Databases - Real-World Applications of Secure Multi-Party","volume":"61","author":"Archer David W.","year":"2018","unstructured":"David W. Archer , Dan Bogdanov , Yehuda Lindell , Liina Kamm , Kurt Nielsen , Jakob Illeborg Pagter , Nigel P. Smart , and Rebecca N. Wright . 2018 . From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Comput. J. 61 , 12 (2018), 1749 -- 1771 . David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, and Rebecca N. Wright. 2018. From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Comput. J. 61, 12 (2018), 1749--1771.","journal-title":"Computation. Comput. J."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20. International Foundation for Autonomous Agents and Multiagent Systems, 1747--1749","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov , Tucker Hybinette Balch , Antigoni Polychroniadou , and Manuela Veloso . 2020 . Privacy-Preserving Dark Pools . In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20. International Foundation for Autonomous Agents and Multiagent Systems, 1747--1749 . Gilad Asharov, Tucker Hybinette Balch, Antigoni Polychroniadou, and Manuela Veloso. 2020. Privacy-Preserving Dark Pools. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20. International Foundation for Autonomous Agents and Multiagent Systems, 1747--1749."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978410"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). ACM, 1--10","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 (STOC). ACM, 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 (STOC). ACM, 1--10."},{"key":"e_1_3_2_1_7_1","volume-title":"13th International Conference, FC 2009, Accra Beach, Barbados, February 23--26","volume":"5628","author":"Bogetoft Peter","year":"2009","unstructured":"Peter Bogetoft , Dan Lund Christensen , Ivan Damg\u00e5rd , Martin Geisler , Thomas P. Jakobsen , Mikkel Kr\u00f8igaard , Janus Dam Nielsen , Jesper Buus Nielsen , Kurt Nielsen , Jakob Pagter , Michael I. Schwartzbach , and Tomas Toft . 2009 . Secure Multiparty Computation Goes Live. In Financial Cryptography and Data Security , 13th International Conference, FC 2009, Accra Beach, Barbados, February 23--26 , 2009. Revised Selected Papers (Lecture Notes in Computer Science) , Vol. 5628 . Springer, 325--343. Peter Bogetoft, Dan Lund Christensen, Ivan Damg\u00e5rd, Martin Geisler, Thomas P. Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft. 2009. Secure Multiparty Computation Goes Live. In Financial Cryptography and Data Security, 13th International Conference, FC 2009, Accra Beach, Barbados, February 23--26, 2009. Revised Selected Papers (Lecture Notes in Computer Science), Vol. 5628. Springer, 325--343."},{"key":"e_1_3_2_1_8_1","volume-title":"Innovations in Theoretical Computer Science","author":"Brakerski Zvika","year":"2012","unstructured":"Zvika Brakerski , Craig Gentry , and Vinod Vaikuntanathan . 2012. (Leveled) fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science 2012 , Cambridge, MA , USA, January 8--10, 2012. ACM , 309--325. Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8--10, 2012. ACM, 309--325."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329809"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646752.756946"},{"key":"e_1_3_2_1_12_1","first-page":"629","article-title":"SCAPI: The Secure Computation Application Programming Interface","volume":"2012","author":"Ejgenberg Yael","year":"2012","unstructured":"Yael Ejgenberg , Moriya Farbstein , Meital Levy , and Yehuda Lindell . 2012 . SCAPI: The Secure Computation Application Programming Interface . IACR Cryptol. ePrint Arch. 2012 (2012), 629 . Yael Ejgenberg, Moriya Farbstein, Meital Levy, and Yehuda Lindell. 2012. SCAPI: The Secure Computation Application Programming Interface. IACR Cryptol. ePrint Arch. 2012 (2012), 629.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_13_1","volume-title":"Advances in Cryptology: Proceedings of CRYPTO '82","author":"Even Shimon","year":"1982","unstructured":"Shimon Even , Oded Goldreich , and Abraham Lempel . 1982. A Randomized Protocol for Signing Contracts . In Advances in Cryptology: Proceedings of CRYPTO '82 , Santa Barbara , California, USA, August 23--25, 1982 . Plenum Press , New York, 205--210. Shimon Even, Oded Goldreich, and Abraham Lempel. 1982. A Randomized Protocol for Signing Contracts. In Advances in Cryptology: Proceedings of CRYPTO '82, Santa Barbara, California, USA, August 23--25, 1982. Plenum Press, New York, 205--210."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_1_17_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. ACM, 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. ACM, 218--229."},{"key":"e_1_3_2_1_18_1","volume-title":"23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science)","volume":"2729","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai , Joe Kilian , Kobbi Nissim , and Erez Petrank . 2003 . Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003 , 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science) , Vol. 2729 . Springer, 145--161. Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science), Vol. 2729. Springer, 145--161."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings, Part I (Lecture Notes in Computer Science)","volume":"9215","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller , Emmanuela Orsini , and Peter Scholl . 2015 . Actively Secure OT Extension with Optimal Overhead. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16--20, 2015 , Proceedings, Part I (Lecture Notes in Computer Science) , Vol. 9215 . Springer, 724--741. Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16--20, 2015, Proceedings, Part I (Lecture Notes in Computer Science), Vol. 9215. Springer, 724--741."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"e_1_3_2_1_21_1","volume-title":"8th International Conference, CANS 2009, Kanazawa, Japan, December 12--14, 2009. Proceedings (Lecture Notes in Computer Science)","volume":"5888","author":"Kolesnikov Vladimir","year":"2009","unstructured":"Vladimir Kolesnikov , Ahmad-Reza Sadeghi , and Thomas Schneider . 2009 . Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In Cryptology and Network Security , 8th International Conference, CANS 2009, Kanazawa, Japan, December 12--14, 2009. Proceedings (Lecture Notes in Computer Science) , Vol. 5888 . Springer, 1--20. Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. 2009. Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12--14, 2009. Proceedings (Lecture Notes in Computer Science), Vol. 5888. Springer, 1--20."},{"key":"e_1_3_2_1_22_1","volume-title":"ICALP 2008 (Lecture Notes in Computer Science)","volume":"5126","author":"Kolesnikov Vladimir","year":"2008","unstructured":"Vladimir Kolesnikov and Thomas Schneider . 2008 . Improved Garbled Circuit: Free XOR Gates and Applications. In Automata, Languages and Programming , ICALP 2008 (Lecture Notes in Computer Science) , Vol. 5126 . Springer, 486--498. Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In Automata, Languages and Programming, ICALP 2008 (Lecture Notes in Computer Science), Vol. 5126. Springer, 486--498."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.31.0057"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365502"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17","author":"Rabin Tal","year":"1989","unstructured":"Tal Rabin and Michael Ben-Or . 1989 . Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) . In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17 , 1989, Seattle, Washigton, USA. ACM, 73--85. Tal Rabin and Michael Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17, 1989, Seattle, Washigton, USA. ACM, 73--85."},{"key":"e_1_3_2_1_29_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. IEEE Computer Society, 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. IEEE Computer Society, 160--164."},{"key":"e_1_3_2_1_30_1","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets (Extended Abstract) . In 27th Annual Symposium on Foundations of Computer Science , Toronto, Canada, 27- -29 October 1986. IEEE Computer Society, 162--167. Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27--29 October 1986. IEEE Computer Society, 162--167."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"ICAIF'21: 2nd ACM International Conference on AI in Finance","location":"Virtual Event","acronym":"ICAIF'21","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the Second ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490354.3494400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490354.3494400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:42Z","timestamp":1750188642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490354.3494400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,3]]},"references-count":30,"alternative-id":["10.1145\/3490354.3494400","10.1145\/3490354"],"URL":"https:\/\/doi.org\/10.1145\/3490354.3494400","relation":{},"subject":[],"published":{"date-parts":[[2021,11,3]]},"assertion":[{"value":"2022-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}