Prime Match: A Privacy-Preserving Inventory Matching System
Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Flock: A Framework for Deploying On-Demand Distributed TrustDarya Kaviani, Sijun Tan, Pravein Govindan Kannan, Raluca Ada PopaOSDI 2024 · 被引用 5 次
- Helium: Scalable MPC among Lightweight Participants and under ChurnChristian Mouchet, Sylvain Chatel, Apostolos Pyrgelis, Carmela TroncosoCCS 2024 · 被引用 2 次
它引用的顶会 Paper5
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- High-Throughput Semi-Honest Secure Three-Party Computation with an Honest MajorityToshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof 等CCS 2016 · 被引用 463 次
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 212 次
- Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for ServicesMatteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca NizzardoCCS 2017 · 被引用 170 次
- FuturesMEX: Secure, Distributed Futures Market ExchangeFabio Massacci, Chan Nam Ngo, Jing Nie, Daniele Venturi 等S&P 2018 · 被引用 33 次
相关 Paper
- PRIME: Efficient Algorithm for Token Graph Routing ProblemHaotian Xu, Yuqing Zhu, Yuming Huang, Jing TangICDE 2026
- Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure ComputationsRuiyu Zhu, Changchang Ding, Yan HuangCCS 2019 · 被引用 21 次
- The Return of Eratosthenes: Secure Generation of RSA Moduli using Distributed SievingCyprien Delpech de Saint Guilhem, Eleftheria Makri, Dragos Rotaru, Titouan TanguyCCS 2021 · 被引用 1 次
- Secure Sublinear Time Differentially Private Median ComputationJonas Böhler, Florian KerschbaumNDSS 2020
- Secure Multiparty Computation with Sublinear PreprocessingElette Boyle, Niv Gilboa, Yuval Ishai, Ariel NofEUROCRYPT 2022 · 被引用 12 次
