Cryptographic Combinatorial Securities Exchanges

We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information about the securities in the baskets from being exploited, enhancing trust. Our exchange offers institutions who wish to trade large positions a new alternative to existing methods of block trading: they can reduce transaction costs by taking advantage of other institutions' available liquidity, while third party liquidity providers guarantee execution--preserving their desired portfolio composition at all times. In our exchange, institutions submit encrypted orders which are crossed, leaving a "remainder". The exchange proves facts about the portfolio risk of this remainder to third party liquidity providers without revealing the securities in the remainder, the knowledge of which could also be exploited. The third parties learn either (depending on the setting) the portfolio risk parameters of the remainder itself, or how their own portfolio risk would change if they were to incorporate the remainder into a portfolio they submit. In one setting, these third parties submit bids on the commission, and the winner supplies necessary liquidity for the entire exchange to clear. This guaranteed clearing, coupled with external price discovery from the primary markets for the securities, sidesteps difficult combinatorial optimization problems. This latter method of proving how taking on the remainder would change risk parameters of one's own portfolio, without revealing the remainder's contents or its own risk parameters, is a useful protocol of independent interest.

[1]  Michael Szydlo,et al.  Risk Assurance for Hedge Funds Using Zero Knowledge Proofs , 2005, Financial Cryptography.

[2]  David C. Parkes,et al.  ICE: an iterative combinatorial exchange , 2005, EC '05.

[3]  Joseph Bonneau,et al.  What's in a Name? , 2020, Financial Cryptography.

[4]  Andrew Odlyzko,et al.  Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.

[5]  Giovanni Di Crescenzo,et al.  Privacy for the Stock Market , 2002, Financial Cryptography.

[6]  Sean W. Smith Trusted Computing Platforms - Design and Applications , 2005 .

[7]  Leslie R. Fine,et al.  Inducing liquidity in thin financial markets through combined-value trading mechanisms , 2002 .

[8]  David C. Parkes,et al.  Cryptographic Securities Exchanges , 2007, Financial Cryptography.

[9]  David C. Parkes,et al.  Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.

[10]  Fabrice Boudot,et al.  Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.

[11]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[12]  David C. Parkes,et al.  WITHDRAWN: Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2008 .

[13]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[14]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[15]  Trey Smith,et al.  Constructing and Clearing Combinatorial Exchanges Using Preference Elicitation , 2002 .

[16]  Rocco A. Servedio,et al.  Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[17]  Aggelos Kiayias,et al.  Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination , 2006, Financial Cryptography.

[18]  Sunju Park,et al.  Protocol completion incentive problems in cryptographic Vickrey auctions , 2008, Electron. Commer. Res..

[19]  Bart Preneel,et al.  Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .

[20]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[21]  Abhi Shelat,et al.  Fair-Zero Knowledge , 2005, TCC.

[22]  Christopher Thorpe,et al.  Time-Lapse Cryptography , 2006 .

[23]  Felix Brandt,et al.  (Im)possibility of unconditionally privacy-preserving auctions , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[24]  David C. Parkes,et al.  Achieving Budget-Balance with Vickrey-Based Payment Schemes in Combinatorial Exchanges , 2001 .