Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder

DOI10.1007/978-3-642-01465-9_13MaRDI QIDQ3619471zbMATH OpenOpenAlexFDO

Authors Francis Klay, Laurent Vigneron

Publication date 7 April 2009

Published in Formal Aspects in Security and Trust (Search for Journal in Brave)

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

zbMATH Keywords

authenticationautomatic analysisAVISPA Toolcryptographic protocolsfairnessnon-repudiation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Security analysis of efficient (Un-) fair non-repudiation protocols
• Automatic analysis of a non-repudiation protocol
• On the security of fair non-repudiation protocols
• Non-repudiation analysis using \textsc{LySa} with annotations
• scientific article; zbMATH DE number 1304004

Cited in

(6)

• Non-repudiation analysis using \textsc{LySa} with annotations
• An extension of formal analysis method with reasoning: a case study of flaw detection for non-repudiation and fairness
• Security analysis of efficient (Un-) fair non-repudiation protocols
• Automatic analysis of a non-repudiation protocol
• State and progress in strand spaces: proving fair exchange
• scientific article; zbMATH DE number 1864595 (Why is no real title available?)

This page was built for publication: Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder

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