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
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01337416
Contributor : Jannik Dreier <>
Submitted on : Saturday, June 25, 2016 - 11:59:19 PM
Last modification on : Thursday, December 20, 2018 - 5:10:16 PM

File

asiaccs2013.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

601

Files downloads

105