Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Protocol Interactions and the Chosen Protocol Attack
Proceedings of the 5th International Workshop on Security Protocols
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Abstraction and Refinement in Protocol Derivation
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
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
Scalable Protocols for Authenticated Group Key Exchange
Journal of Cryptology
Authentication tests and disjoint encryption: A design method for security protocols
Journal of Computer Security - Special issue on CSFW15
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Cryptographic Protocol Composition via the Authentication Tests
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Transformations between Cryptographic Protocols
Foundations and Applications of Security Analysis
Searching for shapes in cryptographic protocols
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Safely composing security protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Sound security protocol transformations
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Sessions and separability in security protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
Cryptographic protocol designers work incrementally. Having achieved some goals for confidentiality and authentication in a protocol Π1 , they transform it to a richer Π2 to achieve new goals. But do the original goals still hold? More precisely, if a goal formula Γ holds whenever Π1 runs against an adversary, does a translation of Γ hold whenever Π2 runs against it? We prove that a transformation preserves goal formulas if a labeled transition system for analyzing Π1 simulates a portion of an lts for analyzing Π2 , while preserving progress in that portion. Thus, we examine the process of analyzing a protocol Π. We use ltss that describe our activity when analyzing Π, not that of the principals executing Π. Each analysis step considers--for an observed message reception--what earlier transmissions would explain it. The lts then contains a transition from a fragmentary execution containing the reception to a richer one containing an explaining transmission. The strand space protocol analysis tool cpsa generates some of the ltss used.