CryptoDB
Ke Wu
Publications and invited talks
Year
Venue
Title
2025
CRYPTO
Foundations of Platform-Assisted Auctions
Abstract
Today, many auctions are carried out with the help of in-
termediary platforms like Google and eBay. These platforms serve as a
rendezvous point for the buyers and sellers, and charge a fee for its ser-
vice. We refer to such auctions as platform-assisted auctions. Tradition-
ally, the auction theory literature mainly focuses on designing auctions
that incentivize the buyers to bid truthfully, assuming that the platform
always faithfully implements the auction. In practice, however, the plat-
forms have been found to manipulate the auctions to earn more profit,
resulting in high-profile anti-trust lawsuits.
We propose a new model for studying platform-assisted auctions in the
permissionless setting, where anyone can register and participate in the
auction. We explore whether it is possible to design a dream auction
in this new model, such that honest behavior is the utility-maximizing
strategy for each individual buyer, the platform, the seller, as well as
platform-seller or platform-buyer coalitions. Through a collection of fea-
sibility and infeasibility results, we carefully characterize the mathemat-
ical landscape of platform-assisted auctions.
Interestingly, our work reveals exciting connections between cryptogra-
phy and mechanism design. We show how cryptography can lend to the
design of an efficient platform-assisted auction with dream properties. Al-
though a line of works have also used multi-party computation (MPC)
or the blockchain to remove the reliance on a trusted auctioneer, our
work is distinct in nature in several dimensions. First, we initiate a sys-
tematic exploration of the game theoretic implications when the service
providers (e.g., nodes that implement the MPC or blockchain protocol)
are strategic and can collude with sellers or buyers. Second, we observe
that the full simulation paradigm used in the standard MPC literature is
too stringent and leads to high asymptotical costs. Specifically, because
every player has a different private outcome in an auction protocol, to
the best of our knowledge, running any generic MPC protocol among
the players would incur at least n 2 total cost where n is the number of
buyers. We propose a new notion of simulation called utility-dominated
emulation that is sufficient for guaranteeing the game-theoretic proper-
ties needed in an auction. Under this new notion of simulation, we show
how to design efficient auction protocols with quasilinear efficiency, which
gives an n-fold improvement over any generic approach.
2025
ASIACRYPT
Game-Theoretically Fair Coin Toss with Arbitrary Preferences
Abstract
Fair multi-party coin toss protocols are fundamental to many cryptographic applications. While Cleve's celebrated result (STOC'86) showed that strong fairness is impossible against half-sized coalitions, recent works have explored a relaxed notion of fairness called Cooperative-Strategy-Proofness (CSP-fairness). CSP-fairness ensures that no coalition has an incentive to deviate from the protocol. Previous research has established the feasibility of CSP-fairness against majority-sized coalitions, but these results focused on specific preference structures where each player prefers exactly one outcome out of all possible choices. In contrast, real-world scenarios often involve players with more complicated preference structures, rather than simple binary choices.
In this work, we initiate the study of CSP-fair multi-party coin toss protocols that accommodate arbitrary preference profiles, where each player may have an unstructured utility distribution over all possible outcomes. We demonstrate that CSP-fairness is attainable against majority-sized coalitions even under such arbitrary preferences. In particular, we give the following results:
\begin{itemize}
\item We give a reduction from achieving CSP-fairness for arbitrary preference profiles to achieving CSP-fairness for structured split-bet profiles, where each player distributes the same amount of total utility across all outcomes.
\item We present two CSP-fair protocols: (1) a \emph{size-based protocol}, which defends against majority-sized coalitions, and (2) a \emph{bets-based protocol}, which defends against coalitions controlling a majority of the total utilities.
\item Additionally, we establish an impossibility result for CSP-fair binary coin toss with split-bet preferences, showing that our protocols are nearly optimal.
\end{itemize}
2024
CRYPTO
Game-Theoretically Fair Distributed Sampling
Abstract
Cleve's celebrated result (STOC'86) showed that a strongly fair multi-party coin-toss is impossible in the presence of majority-sized coalitions. Recently, however, a fascinating line of work studied a relaxed fairness notion called \emph{game-theoretic fairness}, which guarantees that no coalition should be incentivized to deviate from the prescribed protocol. A sequence of works has explored the feasibility of game-theoretic fairness for \emph{two-sided} coin-toss, and indeed demonstrated feasibility in the dishonest majority setting under standard cryptographic assumptions. In fact, the recent work of Wu, Asharov, and Shi (EUROCRYPT'22) completely characterized the regime where game-theoretic fairness is feasible. However, this line of work is largely restricted to two-sided coin-toss, and more precisely on a \emph{uniform} coin-toss (i.e., Bernoulli with parameter $1/2$). The only exceptions are the works on game-theoretically fair leader election, which can be viewed as a special case of uniform $n$-sided coin-toss where $n$ is the number of parties.
In this work, we \emph{initiate} the comprehensive study of game-theoretic fairness for multi-party \emph{sampling from general distributions}. In particular, for the case of $m$-sided \emph{uniform} coin-toss we give a nearly complete characterization of the regime in which game-theoretic fairness is feasible. Interestingly, contrary to standard fairness notions in cryptography, the composition of game-theoretically fair two-sided coin-toss protocols does not necessarily yield game-theoretically fair multi-sided coins. To circumvent this, we introduce new techniques compatible with game-theoretic fairness.
In particular, we give the following results:
- We give a protocol from standard cryptographic assumptions that achieves game-theoretic fairness for uniform $m$-sided coin-toss against half- or more-sized adversarial coalitions.
- To complement our protocol, we give a general impossibility result that establishes the optimality of our protocol for a broad range of parameters modulo an additive constant. Even in the worst-case, the gap between our protocol and our impossibility result is only a small constant multiplicative factor.
- We also present a game-theoretically fair protocol for \emph{any} efficiently sampleable $m$-outcome distribution in the dishonest majority setting. For instance, even for the case of $m=2$ (i.e., two-sided coin-toss), our result implies a game-theoretically fair protocol for an \emph{arbitrary} Bernoulli coin. In contrast, the work of Wu, Asharov, and Shi only focussed on a Bernoulli coin with parameter $1/2$.
Coauthors
- Hao Chung (1)
- Elaine Shi (1)
- Pratik Soni (1)
- Sri AravindaKrishnan Thyagarajan (1)
- Ke Wu (3)
- Forest Zhang (1)