Verifiability in e-Auction Protocols - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Verifiability in e-Auction Protocols

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 perform a detailed study of the verifiability for three examples. We provide an analysis of the protocol by Sako in the applied π-calculus with help of ProVerif, finding it to be correct. Additionally we identify issues with two other protocols.
Fichier principal
Vignette du fichier
main.pdf (163.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01338057 , version 1 (13-12-2017)

Identifiers

  • HAL Id : hal-01338057 , version 1

Cite

Jannik Dreier, Hugo Jonker, Pascal Lafourcade. Verifiability in e-Auction Protocols. 1st Workshop on Hot Issues in Security Principles and Trust (HotSpot'13), Mar 2013, Rome, Italy. ⟨hal-01338057⟩
789 View
127 Download

Share

Gmail Facebook X LinkedIn More