Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
The Game of the Name in Cryptographic Tables
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
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
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proving Security Protocols Correct
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Towards a Completeness Result for Model Checking of Security Protocols
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Proving Security Protocols with Model Checkers by Data Independence Techniques
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Compositional Reasoning in the Spi-calculus
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Formal to Practical Security
Comparing State Spaces in Automatic Security Protocol Analysis
Formal to Practical Security
A Proof Theoretic Analysis of Intruder Theories
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Formalising Observer Theory for Environment-Sensitive Bisimulation
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Programming cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Verifying a chipcard-based biometric identification protocol in VSE
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Recursion versus replication in simple cryptographic protocols
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Static analysis of authentication
Foundations of Security Analysis and Design III
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A generic model for analyzing security protocols
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy properties of the protocol. However, this approach suffers from a state-explosion problem that causes the set of states and traces to be typically infinite or very large. In this paper, starting from a process language inspired by the spi-calculus, we propose a symbolic operational semantics that relies on unification and leads to compact models of protocols. We prove that the symbolic and the conventional semantics are in full agreement, and then give a method by which trace analysis can be carried out directly on the symbolic model. The method is proven to be complete for the considered class of properties and is amenable to automatic checking.