Welcome to the InfoSci Platform
Analyzing the Privacy of a Vickrey Auction Mechanism

Analyzing the Privacy of a Vickrey Auction Mechanism

Ismael Rodriguez, Natalia Lopez
Copyright: © 2006 |Volume: 2 |Issue: 3 |Pages: 11
ISSN: 1548-1131|EISSN: 1548-114X|ISSN: 1548-1131|EISBN13: 9781615205608|EISSN: 1548-114X|DOI: 10.4018/jebr.2006070102
Cite Article Cite Article

MLA

Rodriguez, Ismael, and Natalia Lopez. "Analyzing the Privacy of a Vickrey Auction Mechanism." IJEBR vol.2, no.3 2006: pp.17-27. http://doi.org/10.4018/jebr.2006070102

APA

Rodriguez, I. & Lopez, N. (2006). Analyzing the Privacy of a Vickrey Auction Mechanism. International Journal of E-Business Research (IJEBR), 2(3), 17-27. http://doi.org/10.4018/jebr.2006070102

Chicago

Rodriguez, Ismael, and Natalia Lopez. "Analyzing the Privacy of a Vickrey Auction Mechanism," International Journal of E-Business Research (IJEBR) 2, no.3: 17-27. http://doi.org/10.4018/jebr.2006070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article studies the properties of a distributed mechanism to perform the Vickrey auction. This mechanism, which was originally presented in López, Núñez, Rodríguez, and Rubio (2004), has the main characteristic that most of the information concerning the bids is kept private for both bidders and the auctioneer without the necessity of any trusted third party. In particular, after the auction is finished, only the value of the second-highest bid and the identity of the highest bidder are publicly revealed. However, in that paper, several questions about the applicability of the protocol were left unanswered. In particular, no implementation was provided. Besides, the analysis of the collusion risk was too brief. In this paper, we address these issues in a deeper way. Let us note that, as it is stated in Brandt and Sandholm (2004), it is impossible to create a completely private mechanism to perform the Vickrey auction. In particular, we identify a gap between the proposed protocol and the complete privacy: If any n-2 bidders and the winning bidder collude, the privacy is lost. Besides, some privacy properties can be broken by chance if some specific situations appear, though the probability of this threat decreases as the number of bidders increases. In addition, we present and analyze a simple implementation of the protocol, and we consider its practical applicability.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.