Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol (Q2392053)

In [J. Cryptology 1, 65--75 (1988; Zbl 0654.94012)] \textit{D.~Chaum} proposed an unconditionally secure protocol which allows to send and receive messages anonymously. This protocol, called Dining Cryptographers' Protocol, makes possible an implementation of sealed bid auctions [\textit{F.~Stajano and R. J.~Anderson}, ``The cocaine auction protocol: on the power of anonymous broadcast'', Information Hiding Third International Workshop, IH'99, Lect. Notes Comput. Sci. 1768, 434--447 (1999)]. This paper is connected with \textit{M.~Bárász} et al., in [Tatra Mt. Math. Publ. 57, 85--99 (2013; Zbl 1345.94035)], where the authors mellow the perfect anonymity designed in Dining Cryptographers' Protocol. The presented protocol realizes anonymous sealed bid auctions, such as first price or Vickrey auction and allows to identify at least one dishonest participant violating the protocol without using of Trusted Third Parties. Additionally, if the winner failing to make the required purchase, the protocol allows the remaining participants to establish the identity of the winner.