SearcharxivSearch

arXiv subjects

Benjamin Diamond

Publications and source records attributed to Benjamin Diamond.

3 recordsLinked to original sources

Prime Match: A Privacy-Preserving Inventory Matching System

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.

cs.CR

A Generalized Cover's Problem

Generalizing a problem posed by Cover, we propose an adversarial game in which a permutation is incrementally constructed in a setting of partial information. As in the secretary problem, this permutation is exposed in stages via the successive components of its Lehmer code. Extending Cover's result, which constitutes the case $n = 2$, we establish that a random permutation of $n$ adversarially constructed real numbers can be reconstructed with better-than-random probability, provided that certain among the numbers it permutes are made visible during the process.

math.PR

Smooth Surfaces in Smooth Fourfolds with Vanishing First Chern Class

According to a conjecture attributed to Hartshorne and Lichtenbaum and proven by Ellingsrud and Peskine, the smooth rational surfaces in $\mathbb{P}^4$ belong to only finitely many families. We formulate and study a collection of analogous problems in which $\mathbb{P}^4$ is replaced by a smooth fourfold $X$ with vanishing first integral Chern class. We embed such $X$ into a smooth ambient variety and count families of smooth surfaces which arise in $X$ from the ambient variety. We obtain various finiteness results in such settings. The central technique is the introduction of a new numerical invariant for smooth surfaces in smooth fourfolds with vanishing first Chern class.

math.AG