Optimization of ProVerif Programs for AKE Protocols

DOI10.1134/S0361768822080035MaRDI QIDQ6486106zbMATH OpenFDO

Authors E. M. Vinarskii, A. V. Demakov

Publication date 5 January 2023

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0361768822080035

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Cryptography (94A60)

Recommendations

• Cryptographic protocol security analysis based on bounded constructing algorithm
• Alice and Bob meet equational theories
• Three systems for cryptographic protocol analysis
• scientific article; zbMATH DE number 1024091
• A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming

Cited in

(1)

• An Optimizing Protocol Transformation for Constructor Finite Variant Theories in Maude-NPA

This page was built for publication: Optimization of ProVerif Programs for AKE Protocols

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