Leaderless Auctions Use Threshold Encryption to Limit Last-Look Advantage

Summary

The document presents a decentralized auction design intended to reduce last-look advantage, where a participant can submit or cancel a bid later than others after seeing market information. Participants send signed, threshold-encrypted bids to one another within a timed first round, then exchange sets of the bids they received. Later rounds reconcile the sets, decrypt valid bids, and determine the winner; aggregated signatures allow results to be verified on Ethereum. Fault proofs and penalties discourage participants from withholding or selectively distributing bids.

The design assumes a predetermined committee with more than two thirds honest, synchronized clocks, and timely message delivery among honest participants. Its authors acknowledge that network partitions can penalize honest participants, faster connections can still confer a timing edge, and public bids are unencrypted in this version. The paper gives a protocol rationale and proof sketches for its stated properties, but does not report empirical performance or show that the assumptions hold in deployment.

Key ideas

• Threshold encryption keeps committee members from seeing one another’s bids before they submit their own.
• Exchanging signed bid sets helps establish which bids arrived before the round deadline.
• Fault proofs and penalties discourage participants from withholding bids or preserving a free option to cancel.
• The protocol relies on an honest supermajority, synchronized clocks, and timely communication.
• Lower latency and unencrypted public bids remain sources of advantage in the described design.

Tags

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.