Using probabilistic automata for security protocols verification

DOI10.17512/JAMCM.2016.2.13MaRDI QIDQ2201275zbMATH OpenOpenAlexFDO

Authors Olga Siedlecka-Lamch, Mirosław Kurkowski, Jacek Piątkowski

Publication date 28 September 2020

Published in Journal of Applied Mathematics and Computational Mechanics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.17512/jamcm.2016.2.13

zbMATH Keywords

probabilistic methodsverification of security protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Models and Proofs of Protocol Security: A Progress Report
• Formal analysis and parallelism in protocols
• scientific article; zbMATH DE number 1692932
• scientific article; zbMATH DE number 2102391
• Operational semantics and verification of security protocols.

Cites work

• Computer Aided Verification
• On the security of public key protocols
• Verifying security protocols modelled by networks of automata

Cited in

(7)

• Automated identification of desynchronisation attacks on shared secrets
• Modeling adversaries in a logic for security protocol analysis
• Formal analysis and parallelism in protocols
• Challenges in the Automated Verification of Security Protocols
• Foundations of Software Science and Computation Structures
• AI 2005: Advances in Artificial Intelligence
• Using probabilistic Kleene algebra pKA for protocol verification

This page was built for publication: Using probabilistic automata for security protocols verification

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