Typing Messages for Free in Security Protocols

DOI10.1145/3343507zbMath1433.68211OpenAlexW2797326439WikidataQ127254722 ScholiaQ127254722MaRDI QIDQ4972165

Rémy Chrétien, Stéphanie Delaune, Antoine Dallon, Véronique Cortier

Publication date: 22 November 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3343507

zbMATH Keywords

verificationsecurity protocolstrace equivalencesymbolic model

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Efficiently deciding equivalence for standard primitives and phases ⋮ A decidable class of security protocols for both reachability and equivalence properties

This page was built for publication: Typing Messages for Free in Security Protocols