Verifiability in e-Auction Protocols
Résumé
—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.
Domaines
Cryptographie et sécurité [cs.CR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...