Communicating sequential processes
Communicating sequential processes
Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
Strand spaces: proving security protocols correct
Journal of Computer Security
Using encryption for authentication in large networks of computers
Communications of the ACM
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Invariant Generation Techniques in Cryptographic Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
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
Verifying security protocols: an application of CSP
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Inductive proofs of computational secrecy
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Analysing TLS in the strand spaces model
Journal of Computer Security
| Hi-index | 0.00 |
The strand spaces model and the rank functions model have both been used successfully to analyse and verify security protocols running on unbounded networks. At first sight, these two approaches appear rather different; however, close inspection reveals that there are strong links between strand spaces and rank functions.