A formal semantics for protocol narrations

DOI10.1016/j.tcs.2007.09.005zbMath1131.68045OpenAlexW2071725114MaRDI QIDQ2463562

Uwe Nestmann, Sébastien Briais

Publication date: 14 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.005

zbMATH Keywords

cryptographic protocolsprotocol narrationsspi-calculus

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Semantics in the theory of computing (68Q55) Network protocols (68M12)

Related Items

Alice and Bob: Reconciling Formal Models and Implementation ⋮ The Evolution of Jolie

Uses Software

• Coq
• OCaml
• Casper

Cites Work

• Operational semantics and verification of security protocols.
• On the semantics of Alice \& Bob specifications of security protocols
• A calculus for cryptographic protocols: The spi calculus
• Authentication tests and the structure of bundles.
• Pattern-matching spi-calculus
• On the security of public key protocols
• Mobile values, new names, and secure communication
• CONCUR 2004 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal semantics for protocol narrations