Reasoning about cryptographic protocols in the spi calculus

DOI10.1007/3-540-63141-0_5zbMath1512.94054OpenAlexW1564764333MaRDI QIDQ6044108

Andrew D. Gordon, Martín Abadi

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63141-0_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Model checking Petri nets with names using data-centric dynamic systems ⋮ Joshua Guttman: pioneering strand spaces ⋮ Security, Cryptography and Directed Bigraphs ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ A calculus for cryptographic protocols: The spi calculus ⋮ Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols ⋮ A comparison of three authentication properties.

Cites Work

• The chemical abstract machine
• Testing equivalences for processes
• Testing equivalence for mobile processes
• Functions as processes
• A logic of authentication
• Unnamed Item
• Unnamed Item

This page was built for publication: Reasoning about cryptographic protocols in the spi calculus