View More View Less
  • 1 ELTECRYPT Research Group, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary
  • 2 Dept. of Computeralgebra, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary
Restricted access

Abstract  

Sealed bid auctions are a popular means of high-stakes bidding, as they eliminate the temporal element from the auction process, allowing participants to take less emotional, more thoughtful decisions. In this paper, we propose a digital communication protocol for conducting sealed bid auctions with high stakes, where the anonymity of bids as well as other aspects of fairness must be protected. The Dining Cryptographers’ Protocol (denoted by DC) was presented by David Chaum in 1988. The protocol allows the participants to broadcast a message anonymously. In a recent paper (Another Twist in the Dining Cryptographers’ Protocol, submitted to the Journal of Cryptology) the authors propose a variant of the original DC eliminating its main disadvantages. In this paper we present a cryptographic protocol realizing anonymous sealed bid auctions, such as first price or Vickrey auction, based on this variant. The proposed scheme allows to identify at least one dishonest participant violating the protocol without using of Trusted Third Parties. Additionally, we require that bids are binding. It is achieved by enabling all participants acting in concert (the so-called “angry mob”) to find out the identity of the winner, in case the winner fails to make the purchase.

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Jun 2020 0 0 0
Jul 2020 0 0 0
Aug 2020 2 0 0
Sep 2020 0 0 0
Oct 2020 1 0 0
Nov 2020 0 0 0
Dec 2020 0 0 0