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
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
A Formal Language for Cryptographic Protocol Requirements
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Using encryption for authentication in large networks of computers
Communications of the ACM
Software reliability methods
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Protocol Interactions and the Chosen Protocol Attack
Proceedings of the 5th International Workshop on Security Protocols
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
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
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Environmental requirements for authentication protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A derivation system and compositional logic for security protocols
Journal of Computer Security
Compositional analysis of contract-signing protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Protocol Composition Logic (PCL)
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
Dynamic types for authentication
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
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
Detecting and preventing type flaws at static time
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A tool-supported method for the design and implementation of secure distributed applications
ESSoS'11 Proceedings of the Third international conference on Engineering secure software and systems
Understanding abstractions of secure channels
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A novel group key agreement protocol for wireless mesh network
Computers and Electrical Engineering
Towards formal validation of trust and security in the internet of services
The future internet
| Hi-index | 0.00 |
Modular composition of security mechanisms is complicated by the way that one mechanism may reveal information that interferes with the security of another. We develop methods for modular reasoning about security protocols, using before-after assertions and protocol invariants. The before-after assertions allow us to prove properties of a sequential composition of protocol steps and therefore enable construction of complex protocols from smaller sub-protocols. Invariants provide a mechanism for ensuring that sub-protocols which are individually secure do not interact insecurely when they are composed to construct a bigger protocol. The application of the method is demonstrated by giving modular formal proofs involving two standard protocols.