Privacy-preserving portfolio pricing
Article No.: 35, Pages 1 - 8
Abstract
Investment banks offer the service of purchasing an entire portfolio from a client in a single transaction. The transaction enables the client to remove unwanted assets from their books, and provides immediate cash to be used in other investments. The bank usually offers a price that is slightly lower than the market price, therefore potentially gaining in this transaction when selling its content later in the market, or by internalizing the portfolio. Even though liquidating the portfolio is advantageous for the client, they are concerned about information regarding their strategies or holdings "leaking" and they would also like to be able to "shop" the portfolio to multiple banks. The current industry practice calls for the client to provide a summarized description of the portfolio without full details of the constituents, leading to imprecise pricing by the banks. We propose a new way for pricing portfolios by adapting secure computation to this domain. Our approach allows the client to maintain secrecy regarding the constituents of the portfolio, while enabling the bank to provide a fair price. We study several metrics for pricing portfolios and provide a suite of two-party protocols for computing those metrics, which are all provably secure. We test our protocols and show their scalability experimentally. We believe that this privacy-preserving pricing method offers the potential to transform the practice of portfolio pricing.
References
[1]
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.
[2]
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.
[3]
Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. 2013. More efficient oblivious transfer and extensions for faster secure computation. In 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4--8, 2013. ACM, 535--548.
[4]
Marshall Ball, Tal Malkin, and Mike Rosulek. 2016. Garbling Gadgets for Boolean and Arithmetic Circuits. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24--28, 2016. ACM, 565--577.
[5]
Donald Beaver. 1996. Correlated Pseudorandomness and the Complexity of Private Computations. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22--24, 1996. ACM, 479--488.
[6]
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.
[7]
Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, 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.
[8]
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.
[9]
Ran Canetti. 2000. Security and Composition of Multiparty Cryptographic Protocols. J. Cryptol. 13, 1 (2000), 143--202.
[10]
John Cartlidge, Nigel P. Smart, and Younes Talibi Alaoui. 2019. MPC Joins The Dark Side. In Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, AsiaCCS 2019, Auckland, New Zealand, July 09--12, 2019. ACM, 148--159.
[11]
David Chaum, Claude Crépeau, and Ivan Damgård. 1987. Multiparty Unconditionally Secure Protocols (Abstract). In Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16--20, 1987, Proceedings (Lecture Notes in Computer Science), Vol. 293. Springer, 462.
[12]
Yael Ejgenberg, Moriya Farbstein, Meital Levy, and Yehuda Lindell. 2012. SCAPI: The Secure Computation Application Programming Interface. IACR Cryptol. ePrint Arch. 2012 (2012), 629.
[13]
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.
[14]
Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004 (Lecture Notes in Computer Science), Vol. 3027. Springer, 1--19.
[15]
Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009. ACM, 169--178.
[16]
Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press.
[17]
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.
[18]
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.
[19]
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.
[20]
Ágnes Kiss and Thomas Schneider. 2016. Valiant's Universal Circuit is Practical. In Advances in Cryptology - EUROCRYPT 2016 (Lecture Notes in Computer Science), Vol. 9665. Springer, 699--728.
[21]
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.
[22]
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.
[23]
Yehuda Lindell and Benny Pinkas. 2009. A Proof of Security of Yao's Protocol for Two-Party Computation. J. Cryptol. 22, 2 (2009), 161--188.
[24]
Harry M. Markowitz. 1952. Portfolio Selection. The Journal of Finance 7, 1 (1952), 77--91.
[25]
Moni Naor and Benny Pinkas. 2001. Efficient oblivious transfer protocols. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7--9, 2001, Washington, DC, USA. ACM/SIAM, 448--457.
[26]
Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. 2008. A Framework for Efficient and Composable Oblivious Transfer. In Advances in Cryptology - CRYPTO 2008 (Lecture Notes in Computer Science), Vol. 5157. Springer, 554--571.
[27]
Michael O. Rabin. 1981. How to exchange secrets with oblivious transfer. Technical Report TR-81 Aiken Computation Lab, Harvard University (1981).
[28]
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.
[29]
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.
[30]
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.
[31]
Samee Zahur, Mike Rosulek, and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In Advances in Cryptology - EUROCRYPT 2015 (Lecture Notes in Computer Science), Vol. 9057. Springer, 220--250.
Recommendations
Privacy-Preserving Dark Pools
AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent SystemsA dark pool is a private forum for trading financial instruments such as equities and derivatives. The service is offered to traders, often representing large financial institutions, who aim to make large trades without telegraphing their intentions in ...
Pricing options with portfolio-holding trading agents in direct double auction
ECAI'16: Proceedings of the Twenty-second European Conference on Artificial IntelligenceOptions constitute integral part of modern financial trades, and are priced according to the risk associated with buying or selling certain asset in future. Financial literature mostly concentrates on risk-neutral methods of pricing options such as ...
Portfolio Choice with Illiquid Assets
We present a model of optimal allocation to liquid and illiquid assets, where illiquidity risk results from the restriction that an asset cannot be traded for intervals of uncertain duration. Illiquidity risk leads to increased and state-dependent risk ...
Comments
Information & Contributors
Information
Published In
November 2021
450 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 May 2022
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ICAIF'21
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 72Total Downloads
- Downloads (Last 12 months)11
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in