Protocol Composition Logic (PCL)
From MaRDI portal
Publication:2864155
DOI10.1016/j.entcs.2007.02.012zbMath1277.68033OpenAlexW2168277905MaRDI QIDQ2864155
Anupam Datta, John C. Mitchell, Ante Derek, Arnab Roy
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.012
Related Items
Compositional System Security with Interface-Confined Adversaries, Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol, Categorical composable cryptography: extended version, Categorical composable cryptography, A framework for compositional verification of security protocols, A survey of symbolic methods in computational analysis of cryptographic systems, Distributed temporal logic for the analysis of security protocol models, Constructing Security Protocol Specifications for Web Services, Safely Composing Security Protocols, Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure protocol composition
- Compositional analysis of contract-signing protocols
- Formal analysis of Kerberos 5
- Probabilistic logic
- The chemical abstract machine
- A calculus for cryptographic protocols: The spi calculus
- Protocols for authentification and key establishment
- Breaking and fixing public-key Kerberos
- The NRL Protocol Analyzer: An Overview
- On the Asynchronous Nature of the Asynchronous π-Calculus
- Proofs of Networks of Processes
- On the security of public key protocols
- Communicating sequential processes
- Using encryption for authentication in large networks of computers
- Mobile values, new names, and secure communication
- Foundations of Software Science and Computation Structures
- An axiomatic basis for computer programming
- Computer Aided Verification
- Automata, Languages and Programming
