On the semantics of Alice \& Bob specifications of security protocols

DOI10.1016/j.tcs.2006.08.041zbMath1153.94450OpenAlexW4245319257WikidataQ115036549 ScholiaQ115036549MaRDI QIDQ860900

Luca Viganò, Carlos Caleiro, David A. Basin

Publication date: 9 January 2007

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

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

zbMATH Keywords

security protocolsAlice \& Bob specificationsmessage sequencesprotocol modelsspi calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Alice and Bob: Reconciling Formal Models and Implementation ⋮ Alice and Bob Meet Equational Theories ⋮ Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap ⋮ A formal semantics for protocol narrations ⋮ Distributed temporal logic for the analysis of security protocol models ⋮ Compiling and securing cryptographic protocols ⋮ The Evolution of Jolie

Uses Software

• AVISPA
• Casper
• OFMC

Cites Work

• An NP decision procedure for protocol insecurity with XOR
• A calculus for cryptographic protocols: The spi calculus
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Pattern-matching spi-calculus
• On the security of public key protocols
• A method for obtaining digital signatures and public-key cryptosystems
• Optimistic fair exchange of digital signatures
• Trustworthy Global Computing
• Computer Aided Verification
• LSCs: Breathing life into message sequence charts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the semantics of Alice \& Bob specifications of security protocols