Typing Messages for Free in Security Protocols: The Case of Equivalence Properties

DOI10.1007/978-3-662-44584-6_26zbMath1417.68124OpenAlexW359430047MaRDI QIDQ3190130

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

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01007580/file/RR-8546.pdf

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems ⋮ Efficiently deciding equivalence for standard primitives and phases ⋮ Unnamed Item ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ Unnamed Item ⋮ 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: The Case of Equivalence Properties