Defining verifiability in e-auction protocols

  • Authors:
  • Jannik Dreier;Hugo Jonker;Pascal Lafourcade

  • Affiliations:
  • Université Grenoble 1, CNRS, Grenoble, France;University of Luxembourg, Luxembourg, Luxembourg;Université Grenoble 1, CNRS, Grenoble, France

  • Venue:
  • Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

An electronic auction protocol will only be used by those who trust that it operates correctly. Therefore, e-auction protocols must be verifiable: seller, buyer and losing bidders must all be able to determine that the result was correct. We pose that the importance of verifiability for e-auctions necessitates a formal analysis. Consequently, we identify notions of verifiability for each stakeholder. We formalize these and then use the developed framework to study the verifiability of two examples, the protocols due to Curtis et al. and Brandt, identifying several issues.