Skip to Main content Skip to Navigation
Conference papers

Brandt's Fully Private Auction Protocol Revisited

Abstract : Auctions have a long history, having been recorded as early as 500 B.C. Nowadays, electronic auctions have been a great success and are increasingly used. Many cryptographic protocols have been proposed to address the various security requirements of these electronic transactions, in particular to ensure privacy. Brandt developed a protocol that computes the winner using homomorphic operations on a distributed ElGamal encryption of the bids. He claimed that it ensures full privacy of the bidders, i.e. no information apart from the winner and the winning price is leaked. We first show that this protocol -- when using malleable interactive zero-knowledge proofs -- is vulnerable to attacks by dishonest bidders. Such bidders can manipulate the publicly available data in a way that allows the seller to deduce all participants' bids. Additionally we discuss some issues with verifiability as well as attacks on non-repudiation, fairness and the privacy of individual bidders exploiting authentication problems.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00745247
Contributor : Jean-Guillaume Dumas <>
Submitted on : Tuesday, May 14, 2013 - 10:56:45 AM
Last modification on : Saturday, March 28, 2020 - 1:12:48 AM
Document(s) archivé(s) le : Tuesday, April 4, 2017 - 6:49:22 AM

Files

brandtrev.pdf
Files produced by the author(s)

Identifiers

Citation

Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade. Brandt's Fully Private Auction Protocol Revisited. Africacrypt 2013, Jun 2013, Le Caire, Egypt. pp.88-106, ⟨10.1007/978-3-642-38553-7_5⟩. ⟨hal-00745247v3⟩

Share

Metrics

Record views

659

Files downloads

689