Paper: arXiv 2310.09621

Authors: Antigoni Polychroniadou, Gilad Asharov, Benjamin Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso

Abstract

Inventory matching is a standard mechanism/auction for trading financial stocks by which buyers and sellers can be paired. In the financial world, banks often undertake the task of finding such matches between their clients. The related stocks can be traded without adversely impacting the market price for either client. If matches between clients are found, the bank can offer the trade at advantageous rates. If no match is found, the parties have to buy or sell the stock in the public market, which introduces additional costs. A problem with the process as it is presently conducted is that the involved parties must share their order to buy or sell a particular stock, along with the intended quantity (number of shares), to the bank. Clients worry that if this information were to leak somehow, then other market participants would become aware of their intentions and thus cause the price to move adversely against them before their transaction finalizes. We provide a solution, Prime Match, that enables clients to match their orders efficiently with reduced market impact while maintaining privacy. In the case where there are no matches, no information is revealed. Our main cryptographic innovation is a two-round secure linear comparison protocol for computing the minimum between two quantities without preprocessing and with malicious security, which can be of independent interest. We report benchmarks of our Prime Match system, which runs in production and is adopted by J.P. Morgan. The system is designed utilizing a star topology network, which provides clients with a centralized node (the bank) as an alternative to the idealized assumption of point-to-point connections, which would be impractical and undesired for the clients to implement in reality. Prime Match is the first secure multiparty computation solution running live in the traditional financial world.

Complexity vs Empirical Score

  • Math Complexity: 8.5/10
  • Empirical Rigor: 8.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper presents advanced cryptographic protocols (secure multiparty computation with malicious security) requiring significant mathematical depth, and it reports production system benchmarks and real-world deployment at J.P. Morgan, demonstrating high empirical implementation rigor.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Secure Inventory Matching"] --> B["Data/Input<br>Buy/Sell Orders & Quantities"]
  B --> C["Methodology<br>Two-Round Secure Linear Comparison"]
  C --> D["Computational Process<br>Compute Minimum for Matching"]
  D --> E{"Outcome<br>Match Found?"}
  E -- Yes --> F["Result<br>Trade at Advantageous Rates"]
  E -- No --> G["Result<br>No Information Revealed"]
  F & G --> H["Final Outcome<br>Maliciously Secure System<br>Adopted by J.P. Morgan"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes Prime Match, a privacy‑preserving inventory‑matching system that uses two new secure protocols (bank‑to‑client and client‑to‑client matching) based on a two‑round secure linear comparison for computing minima.

Source sentence
We provide a solution, Prime Match, that enables clients to match their orders efficiently with reduced market impact while maintaining privacy. Our main cryptographic innovation is a two-round secure linear comparison protocol for computing the minimum between two quantities without preprocessing and with malicious security, which can be of independent interest.

Assumes 3

  • Clients communicate only with the bank in a star‑topology network and do not establish direct connections with other clients. execution
    Source sentence
    Moreover, in the client-to-client matching a star topology network is required where clients communicate only with the bank. Clients do not wish to establish communication with other clients and reveal their identities to other clients. Our contributions.
  • The total number of symbols (stocks) is around 1,000–5,000, requiring each party to provide roughly 2,000–10,000 values. model
    Source sentence
    It is assumed that the total number of symbols is around 1000 −5000, and of course, the number of sides is 2.
  • No offline preprocessing is possible because clients participate only during the live matching phase. execution
    Source sentence
    Furthermore, no offline preprocessing is possible since clients wish to participate only during the live matching phase.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 3

  • Prime Match runs live in production and has been adopted by a large US bank (J.P. Morgan). performance
    Source sentence
    We report benchmarks of our Prime Match system, which runs in production and is adopted by J.P. Morgan. Our system is running live, in production, and is adopted by a large bank in the US – J.P. Morgan.
  • The system provides benchmarks demonstrating the practicality of the secure linear‑comparison protocol. performance
    Source sentence
    We report benchmarks of our Prime Match system, which runs in production and is adopted by J.P. Morgan.
  • Prime Match is the first secure multiparty computation solution deployed live in the traditional financial world. theoretical
    Source sentence
    Prime Match is the first secure multiparty computation solution running live in the traditional financial world.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 8 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.