Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Defining 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 study the verifiability of two examples, the protocols due to Curtis et al. and Brandt, identifying several issues.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Jannik Dreier Connect in order to contact the contributor
Submitted on : Saturday, June 25, 2016 - 11:59:19 PM
Last modification on : Friday, January 21, 2022 - 3:09:02 AM


Files produced by the author(s)



Jannik Dreier, Hugo Jonker, Pascal Lafourcade. Defining Verifiability in e-Auction Protocols. 8th ACM Symposium on Information, Computer and Communications Security (AsiaCCS '13), ACM, May 2013, Hangzhou, China. ⟨10.1145/2484313.2484387⟩. ⟨hal-01337416⟩



Record views


Files downloads