Defining Verifiability in e-Auction ProtocolsReport as inadecuate




Defining Verifiability in e-Auction Protocols - Download this document for free, or read online. Document in PDF available to download.

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, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods 2 Open Universiteit Heerlen 3 LIMOS - Laboratoire d-Informatique, de Modélisation et d-optimisation des Systèmes

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.

Keywords : Protocol Analysis Verifiability e-Auction Formal Methods





Author: Jannik Dreier - Hugo Jonker - Pascal Lafourcade -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents