Cryptology ePrint Archive: Report 2021/264

FAST: Fair Auctions via Secret Transactions

Bernardo David and Lorenzo Gentile and Mohsen Pourpouneh

Abstract: Auctioning an asset with sealed bids has been shown to be economically optimal but requires trusting an auctioneer who analyzes the bids and determines the winner. Many privacy preserving computation protocols for auctions have been proposed, aiming at eliminating the need for a trusted third party. However, they lack fairness, meaning that the adversary learns the outcome of the auction before honest parties and may choose to make the protocol fail without suffering any consequences. In this work, we propose efficient protocols for both first and second price sealed bid auctions with fairness against rational adversaries, leveraging secret cryptocurrency transactions and public smart contracts. In our approach, the bidders jointly compute the winner of the auction while preserving the privacy of losing bids and ensuring that cheaters are financially punished by losing a \emph{secret} collateral deposit. We guarantee that it is never profitable for rational adversaries to cheat by making the deposit equal to the bid plus the cost of running the protocol, i.e., once a party commits to a bid it is guaranteed that it has the funds and it cannot walk away from the protocol without forfeiting the bid. Moreover, our protocols guarantee that the winner is determined and the auction payments are completed even if the adversary misbehaves, so that it cannot force the protocol to fail and then rejoin the auction with an adjusted bid. Our constructions are more efficient than the state-of-the-art even though they achieve stronger security guarantees, i.e., fairness. Interestingly, we show how the second price can be computed with a minimal increase of the complexity of the simpler first price case. Moreover, in case there is no cheating, only collateral deposit and refund transactions must be sent to the smart contract, significantly saving on-chain storage.

Category / Keywords: cryptographic protocols / Auction, Fairness, Blockchain, Privacy Preserving Transactions

Date: received 3 Mar 2021, last revised 4 Mar 2021

Contact author: bernardo at bmdavid com,lorg@itu dk,mohsen@ifro ku dk

Available format(s): PDF | BibTeX Citation

Version: 20210304:150238 (All versions of this report)

Short URL: ia.cr/2021/264


[ Cryptology ePrint archive ]