Artificial Intelligence
ACM Transactions on Computer Systems (TOCS)
A Hookup Theorem for Multilevel Security
IEEE Transactions on Software Engineering
Selected papers of the Second Workshop on Concurrency and compositionality
Authentication and authenticated key exchanges
Designs, Codes and Cryptography
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
A Model for Secure Protocols and Their Compositions
IEEE Transactions on Software Engineering
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Communicating sequential processes
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An axiomatic basis for computer programming
Communications of the ACM
Intercepting mobile communications: the insecurity of 802.11
Proceedings of the 7th annual international conference on Mobile computing and networking
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Dynamic Logic
Kerberos Version 4: Inductive Analysis of the Secrecy Goals
ESORICS '98 Proceedings of the 5th European Symposium on Research in Computer Security
Entity Authentication and Key Distribution
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Protocol Interactions and the Chosen Protocol Attack
Proceedings of the 5th International Workshop on Security Protocols
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Some new attacks upon security protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
I/O Automaton Models and Proofs for Shared-Key Communication Systems
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
On the Composition of Secure Systems
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Compositional Logic for Protocol Correctness
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
Abstraction and Refinement in Protocol Derivation
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Compositional Analysis of Contract Signing Protocols
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
A modular correctness proof of IEEE 802.11i and TLS
Proceedings of the 12th ACM conference on Computer and communications security
A derivation system and compositional logic for security protocols
Journal of Computer Security
Computationally Sound Compositional Logic for Key Exchange Protocols
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Theoretical Computer Science - Automated reasoning for security protocol analysis
Analysis of the SSL 3.0 protocol
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Finite-state analysis of SSL 3.0
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Environmental requirements for authentication protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Breaking and fixing public-key Kerberos
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Secrecy analysis in protocol composition logic
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Protocols for Authentication and Key Establishment
Protocols for Authentication and Key Establishment
Probabilistic polynomial-time semantics for a protocol security logic
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On the security of public key protocols
IEEE Transactions on Information Theory
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Preservation of epistemic properties in security protocol implementations
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for compositional verification of security protocols
Information and Computation
On the protocol composition logic PCL
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Unguessable Atoms: A Logical Foundation for Security
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
An Open Framework for Remote Electronic Elections
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Safely composing security protocols
Formal Methods in System Design
An Automated Approach for Proving PCL Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Formal to Practical Security
From qualitative to quantitative proofs of security properties using first-order conditional logic
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Semantics and logic for security protocols
Journal of Computer Security
Efficient ID-based registration protocol featured with user anonymity in mobile IP networks
IEEE Transactions on Wireless Communications
Safely composing security protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Analysis of EAP-GPSK authentication protocol
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Formal proofs of cryptographic security of Diffie-Hellman-based protocols
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Compositional System Security with Interface-Confined Adversaries
Electronic Notes in Theoretical Computer Science (ENTCS)
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement types for secure implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inductive trace properties for computational security
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Ubiquitous verification of ubiquitous systems
SEUS'10 Proceedings of the 8th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
Journal of Automated Reasoning
A novel group key agreement protocol for wireless mesh network
Computers and Electrical Engineering
Composable security analysis of OS services
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Modular code-based cryptographic verification
Proceedings of the 18th ACM conference on Computer and communications security
Modeling TCG-Based secure systems with colored petri nets
INTRUST'10 Proceedings of the Second international conference on Trusted Systems
A sound decision procedure for the compositionality of secrecy
ESSoS'12 Proceedings of the 4th international conference on Engineering Secure Software and Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Analysing TLS in the strand spaces model
Journal of Computer Security
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a process calculus with actions for possible protocol steps including generating new random numbers, sending and receiving messages, and performing decryption and digital signature verification actions. The proof system consists of axioms about individual protocol actions and inference rules that yield assertions about protocols composed of multiple steps. Although assertions are written only using the steps of the protocol, the logic is sound in a strong sense: each provable assertion involving a sequence of actions holds in any protocol run containing the given actions and arbitrary additional actions by a malicious adversary. This approach lets us prove security properties of protocols under attack while reasoning only about the actions of honest parties in the protocol. PCL supports compositional reasoning about complex security protocols and has been applied to a number of industry standards including SSL/TLS, IEEE 802.11i and Kerberos V5.