Verifiability in e-Auction Protocols

Jannik Dreier 1 Hugo Jonker 2 Pascal Lafourcade 3
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01338057
Contributor : Jannik Dreier <>
Submitted on : Wednesday, December 13, 2017 - 1:54:25 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01338057, version 1

Citation

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⟩

Share

Metrics

Record views

933

Files downloads

34