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

Mihály Bárász; Péter Ligeti; László Mérai; Dániel Nagy

doi:10.1007/s10998-012-6512-6

Jump to Content

Periodica Mathematica Hungarica

Volume/Issue:: Volume 65: Issue 2

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

Authors:

Mihály Bárász

Mihály Bárász ELTECRYPT Research Group, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary

Search for other papers by Mihály Bárász in
Current site
Google Scholar
PubMed

Péter Ligeti

Péter Ligeti Dept. of Computeralgebra, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary

Search for other papers by Péter Ligeti in
Current site
Google Scholar
PubMed

László Mérai

László Mérai Dept. of Computeralgebra, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary

Search for other papers by László Mérai in
Current site
Google Scholar
PubMed

, and

Dániel Nagy

Dániel Nagy ELTECRYPT Research Group, Eötvös Loránd University, Pázmány P. sétány 1/C, H-1117 Budapest, Hungary

Search for other papers by Dániel Nagy in
Current site
Google Scholar
PubMed

View More View Less

Pages:: 167–176

Online Publication Date:: 26 Oct 2012

Publication Date:: 01 Dec 2012

Article Category:: Research Article

DOI:: https://doi.org/10.1007/s10998-012-6512-6

Keywords:: 94A60; 68P25; sealed bid auctions; anonymous broadcast; dining cryptographers; proof of knowledge

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.

Save
Cite
Email this content

Share Link

Copy this link, or click below to email it to a friend
Email this content
or copy the link directly:

https://akjournals.com/abstract/journals/10998/65/2/article-p167.xml
The link was not copied. Your current browser may not support copying via this button.

Link copied successfully

Collapse
Expand

Periodica Mathematica Hungarica

Print ISSN:: 0031-5303

Online ISSN:: 1588-2829

To see the editorial board, please visit the website of Springer Nature.

Manuscript Submission: HERE

For subscription options, please visit the website of Springer Nature.

Periodica Mathematica Hungarica
Language	English
Size	B5
Year of Foundation	1971
Volumes per Year	2
Issues per Year	4
Founder	Bolyai János Matematikai Társulat - János Bolyai Mathematical Society
Founder's Address	H-1055 Budapest, Hungary Falk Miksa u. 12.I/4.
Publisher	Akadémiai Kiadó Springer Nature Switzerland AG
Publisher's Address	H-1117 Budapest, Hungary 1516 Budapest, PO Box 245. CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible Publisher	Chief Executive Officer, Akadémiai Kiadó
ISSN	0031-5303 (Print)
ISSN	1588-2829 (Online)