Pattern-matching spi-calculus
From MaRDI portal
Publication:2500522
Recommendations
Cites work
- A calculus for cryptographic protocols: The spi calculus
- A comparison between strand spaces and multiset rewriting for security protocol analysis
- A logic of authentication
- Analysis of security protocols as open systems
- Analyzing security protocols with secrecy types and logic programs
- CONCUR 2005 – Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Mobile values, new names, and secure communication
- On name generation and set-based analysis in the Dolev-Yao model
- On the security of public key protocols
- Resolution of equations in algebraic structures. Volume II: Rewriting techniques
- Secrecy by typing in security protocols
- Secrecy types for asymmetric communication
- Security protocols and their properties
- TAPS: A first-order verifier for cryptographic protocols
- Typed MSR: Syntax and examples
- Typing one-to-one and one-to-many correspondences in security protocols
Cited in
(8)- Expressiveness of concurrent intensionality
- A formal semantics for protocol narrations
- A sorted semantic framework for applied process calculi (extended abstract)
- Implementing Spi Calculus Using Nominal Techniques
- Typing one-to-one and one-to-many correspondences in security protocols
- Automated type-based analysis of injective agreement in the presence of compromised principals
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
- On the semantics of Alice \& Bob specifications of security protocols
This page was built for publication: Pattern-matching spi-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500522)