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

DOI10.1007/S10998-012-6512-6MaRDI QIDQ2392053zbMATH OpenOpenAlexFDO

Authors Mihály Bárász, László Mérai, Dániel A. Nagy, Péter Ligeti

Publication date 6 August 2013

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10998-012-6512-6

zbMATH Keywords

anonymous broadcastdining cryptographersproof of knowledgesealed bid auctions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

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.

Recommendations

• An efficient multi-round anonymous auction protocol
• Secure sealed-bid online auctions using discreet cryptographic proofs
• scientific article; zbMATH DE number 1980956
• Practical electronic auction scheme with strong anonymity and bidding privacy
• A Two-Server, Sealed-Bid Auction Protocol
• scientific article; zbMATH DE number 773971
• scientific article; zbMATH DE number 1612530

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Another twist in the dining cryptographers' protocol
• How to obtain full privacy in auctions
• scientific article; zbMATH DE number 1689604 (Why is no real title available?)
• scientific article; zbMATH DE number 1941238 (Why is no real title available?)
• scientific article; zbMATH DE number 2044547 (Why is no real title available?)
• scientific article; zbMATH DE number 883898 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2003
• Progress in Cryptology – Mycrypt 2005
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(4)

• A Two-Server, Sealed-Bid Auction Protocol
• scientific article; zbMATH DE number 2048535 (Why is no real title available?)
• scientific article; zbMATH DE number 1844590 (Why is no real title available?)
• An efficient multi-round anonymous auction protocol

This page was built for publication: Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392053)