Table of Contents
Fetching ...

Selling Privacy in Blockchain Transactions

Georgios Chionas, Olga Gorelkina, Piotr Krysta, Rida Laraki

TL;DR

The paper tackles privacy in blockchain transaction ordering by modeling privacy as a controllable feature in economic mechanisms. It develops an optimal sealed-bid privacy auction, a practical l-round Dutch auction with a $1 - rac{1}{e^{\ell}}$ net-utility approximation, and a two-sided privacy marketplace with a posted-price mechanism that achieves a constant-factor welfare guarantee. By integrating differential privacy with mechanism design and leveraging cryptographic primitives, the work provides practical tools to balance revenue, welfare, and user privacy. It also outlines future directions for programmable privacy and information-theoretic analyses in blockchain settings.

Abstract

We study methods to enhance privacy in blockchain transactions from an economic angle. We consider mechanisms for privacy-aware users whose utility depends not only on the outcome of the mechanism but also negatively on the exposure of their economic preferences. Specifically, we study two auction-theoretic settings with privacy-aware users. First, we analyze an order flow auction, where a user auctions off to specialized agents, called searchers, the right to execute her transaction while maintaining a degree of privacy. We examine how the degree of privacy affects the revenue of the auction and, broadly, the net utility of the privacy-aware user. In this new setting, we describe the optimal auction, which is a sealed-bid auction. Subsequently, we analyze a variant of a Dutch auction in which the user gradually decreases the price and the degree of privacy until the transaction is sold. We compare the revenue of this auction to that of the optimal one as a function of the number of communication rounds. Then, we introduce a two-sided market - a privacy marketplace - with multiple users selling their transactions under their privacy preferences to multiple searchers. We propose a posted-price mechanism for the two-sided market that guarantees constant approximation of the optimal social welfare while maintaining incentive compatibility (from both sides of the market) and budget balance. This work builds on the emerging line of research that attempts to improve the performance of economic mechanisms by appending cryptographic primitives to them.

Selling Privacy in Blockchain Transactions

TL;DR

The paper tackles privacy in blockchain transaction ordering by modeling privacy as a controllable feature in economic mechanisms. It develops an optimal sealed-bid privacy auction, a practical l-round Dutch auction with a net-utility approximation, and a two-sided privacy marketplace with a posted-price mechanism that achieves a constant-factor welfare guarantee. By integrating differential privacy with mechanism design and leveraging cryptographic primitives, the work provides practical tools to balance revenue, welfare, and user privacy. It also outlines future directions for programmable privacy and information-theoretic analyses in blockchain settings.

Abstract

We study methods to enhance privacy in blockchain transactions from an economic angle. We consider mechanisms for privacy-aware users whose utility depends not only on the outcome of the mechanism but also negatively on the exposure of their economic preferences. Specifically, we study two auction-theoretic settings with privacy-aware users. First, we analyze an order flow auction, where a user auctions off to specialized agents, called searchers, the right to execute her transaction while maintaining a degree of privacy. We examine how the degree of privacy affects the revenue of the auction and, broadly, the net utility of the privacy-aware user. In this new setting, we describe the optimal auction, which is a sealed-bid auction. Subsequently, we analyze a variant of a Dutch auction in which the user gradually decreases the price and the degree of privacy until the transaction is sold. We compare the revenue of this auction to that of the optimal one as a function of the number of communication rounds. Then, we introduce a two-sided market - a privacy marketplace - with multiple users selling their transactions under their privacy preferences to multiple searchers. We propose a posted-price mechanism for the two-sided market that guarantees constant approximation of the optimal social welfare while maintaining incentive compatibility (from both sides of the market) and budget balance. This work builds on the emerging line of research that attempts to improve the performance of economic mechanisms by appending cryptographic primitives to them.

Paper Structure

This paper contains 13 sections, 8 theorems, 42 equations.

Key Result

Theorem 2.3

Consider a strategyproof auction that awards the item to buyer $i$ with probability $x_i(\mathbf{v})$ and charges $p_i(\mathbf{v})$ on bids $\mathbf{v}$. Then, the expected revenue is

Theorems & Definitions (16)

  • Definition 2.1: Differential Privacy
  • Definition 2.2
  • Theorem 2.3: Myerson's Theorem Myerson81Optimal
  • Lemma 3.1
  • proof
  • Definition 4.1: Batched Prophet Inequality Alaei22DescendingDescrete
  • Corollary 4.2: Decreasing Prices to Decreasing Privacy Enhanced Virtual Values
  • Lemma 4.3
  • Theorem 5.1
  • proof
  • ...and 6 more