The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
A calculus for cryptographic protocols
Information and Computation
Strand spaces: proving security protocols correct
Journal of Computer Security
Casper: a compiler for the analysis of security protocols
Journal of Computer Security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CAPSL Interface for the NRL Protocol Analyzer
ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Authenticity by Typing for Security Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
A calculus for control flow analysis of security protocols
International Journal of Information Security - Special issue on security in global computing
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science
Static validation of security protocols
Journal of Computer Security
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Metareasoning about Security Protocols using Distributed Temporal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Security Protocol Analysis With the AVISPA Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A formal semantics for protocol narrations
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
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
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
A formal semantics for protocol narrations
Theoretical Computer Science
Cryptographic Protocol Explication and End-Point Projection
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Compiling and securing cryptographic protocols
Information Processing Letters
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Towards understanding pure publish/subscribe cryptographic protocols
Security'08 Proceedings of the 16th International conference on Security protocols
Towards the attacker's view of protocol narrations (or, how to compile security protocols)
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Deadlock-freedom-by-design: multiparty asynchronous global programming
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
In the context of security protocols, the so-called Alice&Bob notation is often used to describe the messages exchanged between honest principals in successful protocol runs. While intuitive, this notation is ambiguous in its description of the actions taken by principals, in particular with respect to the conditions they must check when executing their roles and the actions they must take when the checks fail.In this paper, we investigate the semantics of protocol specifications in Alice&Bob notation. We provide both a denotational and an operational semantics for such specifications, rigorously accounting for these conditions and actions. Our denotational semantics is based on a notion of incremental symbolic runs, which reflect the data possessed by principals and how this data increases monotonically during protocol execution. We contrast this with a standard formalization of the behavior of principals, which directly interprets message exchanges as sequences of atomic actions. In particular, we provide a complete characterization of the situations where this simpler, direct approach is adequate and prove that incremental symbolic runs are more expressive in general. Our operational semantics, which is guided by the denotational semantics, implements each role of the specified protocol as a sequential process of the pattern-matching spi calculus.