A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
A calculus for cryptographic protocols
Information and Computation
Using encryption for authentication in large networks of computers
Communications of the ACM
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Different Look at Secure Distributed Computation
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Types for Cryptographic Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Types and Effects for Asymmetric Cryptographic Protocols
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Breaking and fixing public-key Kerberos
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Hi-index | 0.00 |
Many design flaws and incorrect analyses of cryptographic protocols can be traced to inadequate specification languages for message components, environment assumptions, and goals. In this paper, we present MSR, a strongly typed specification language for security protocols, which is intended to address the first two issues. Its typing infrastructure, based on the theory of dependent types with subsorting, yields elegant and precise formalizations, and supports a useful array of static check that include type-checking and access control validation. It uses multiset rewriting rules to express the actions of the protocol. The availability of memory predicates enable it to faithfully encode systems consisting of a collection of coordinated subprotocols, and constraints allow tackling objects belonging to complex interpretation domains, e.g. time stamps, in an abstract and modular way. We apply MSR to the specification of several examples.