Typing messages for free in security protocols

DOI10.1145/3343507MaRDI QIDQ4972165zbMATH OpenOpenAlexWikidataFDO

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

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

security protocolssymbolic modeltrace equivalenceverification

Mathematics Subject Classification ID

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

Recommendations

• Typing messages for free in security protocols: the case of equivalence properties
• Secrecy by typing in security protocols
• scientific article; zbMATH DE number 1927556
• scientific article; zbMATH DE number 1832233
• Typing and compositionality for security protocols: a generalization to the geometric fragment

Cited in

(10)

• A decidable class of security protocols for both reachability and equivalence properties
• Typing and compositionality for security protocols: a generalization to the geometric fragment
• Efficiently deciding equivalence for standard primitives and phases
• Secrecy by typing in security protocols
• Typing messages for free in security protocols: the case of equivalence properties
• Typing access control and secure information flow in sessions
• scientific article; zbMATH DE number 814797 (Why is no real title available?)
• Analysing privacy-type properties in cryptographic protocols (invited talk)
• Information and Communications Security
• Typing copyless message passing

This page was built for publication: Typing messages for free in security protocols

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