On Communication Models When Verifying Equivalence Properties

DOI10.1007/978-3-662-54455-6_7zbMath1444.68035OpenAlexW2604073120MaRDI QIDQ3304813

Kushal Babel, Steve Kremer, Vincent Cheval

Publication date: 3 August 2020

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

Full work available at URL: https://hal.inria.fr/hal-01450898/file/main.pdf

zbMATH Keywords

operational semanticsauthentication protocolclassical semanticsextended process

Mathematics Subject Classification ID

Cryptography (94A60) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25)

Uses Software

• AVISPA
• Apte
• Akiss
• TAMARIN

Cites Work

• Deciding equivalence-based properties using constraint solving
• A calculus for cryptographic protocols: The spi calculus
• Private authentication
• Automated verification of selected equivalences for security protocols
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• Mobile values, new names, and secure communication
• Automated Verification of Equivalence Properties of Cryptographic Protocols
• Computer Aided Verification
• Automating Security Analysis: Symbolic Equivalence of Constraint Systems

This page was built for publication: On Communication Models When Verifying Equivalence Properties