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
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Authentication tests and the structure of bundles
Theoretical Computer Science
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
Automatic verification of cryptographic protocols: a logic programming approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Static validation of security protocols
Journal of Computer Security
Information and Computation
On the semantics of Alice&Bob specifications of security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational semantics of security protocols
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
Cryptographic Protocol Explication and End-Point Projection
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
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 | 5.23 |
Protocol narrations are a widely-used informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also been informally ''turned into'' a number of formal protocol descriptions, e.g., using the spi-calculus. In this paper, we propose a direct formal operational semantics for protocol narrations that fixes a particular and, as we argue, well-motivated interpretation on how the involved protocol participants are supposed to execute. Based on this semantics, we explain and formally justify a natural and precise translation of narrations into spi-calculus. An optimised translation has been implemented in OCaml, and we report on case studies that we have carried out using the tool.