Formal verification of e-auction protocols

DOI10.1007/978-3-642-36830-1_13MaRDI QIDQ5326763zbMATH OpenOpenAlexFDO

Authors Jannik Dreier, Pascal Lafourcade, Yassine Lakhnech

Publication date 6 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36830-1_13

Mathematics Subject Classification ID

Internet topics (68M11) Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• scientific article; zbMATH DE number 773971
• Brandt's fully private auction protocol revisited
• How to obtain full privacy in auctions
• scientific article; zbMATH DE number 1980956
• An electronic online bidding auction protocol with both security and efficiency

Cited in

(9)

• Designing a secure e-tender submission protocol
• Secret, verifiable auctions from elections
• Fairness analysis for multiparty nonrepudiation protocols based on improved strand space
• Formal specification of multi-agent e-barter systems
• Verifying Dominant Strategy Equilibria in Auctions
• Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
• scientific article; zbMATH DE number 1953034 (Why is no real title available?)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Computational and Information Science

Describes a project that uses

Uses Software

• ProVerif

This page was built for publication: Formal verification of e-auction protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326763)