Cryptographic Protocol Composition via the Authentication Tests

DOI10.1007/978-3-642-00596-1_22zbMath1234.94045OpenAlexW1602381506MaRDI QIDQ3617737

Joshua D. Guttman

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_22

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ Stateful protocol composition ⋮ State and progress in strand spaces: proving fair exchange ⋮ Distributed temporal logic for the analysis of security protocol models

Uses Software

• AVISPA
• Casper

Cites Work

• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Authentication tests and the structure of bundles.
• A framework for compositional verification of security protocols
• On the security of public key protocols
• Adding Branching to the Strand Space Model
• Trustworthy Global Computing
• Safely Composing Security Protocols
• Searching for Shapes in Cryptographic Protocols
• Theory of Cryptography

This page was built for publication: Cryptographic Protocol Composition via the Authentication Tests