Modeling concurrency with partial orders
International Journal of Parallel Programming
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th 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
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
On the semantics of Alice&Bob specifications of security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal semantics for protocol narrations
Theoretical Computer Science
Adding Branching to the Strand Space Model
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Programming cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
Hi-index | 0.00 |
The strand space model for the analysis of security protocols is known to have some limitations in the patterns of nondeterminism it allows and in the ways in which strand spaces can be composed. Its successful application to a broad range of security protocols may therefore seem surprising. This paper gives a formal explanation of the wide applicability of strand spaces. We start with an extension of strand spaces which permits several operations to be defined in a compositional way, forming a process language for building up strand spaces. We then show, under reasonable conditions how to reduce the extended strand spaces to ones of the traditional kind. For security protocols we are mainly interested in their safety properties. This suggests a strand-space equivalence: two strand spaces are equivalent if and only if they have essentially the same sets of bundles. However this equivalence is not a congruence with respect to the strand-space operations. By extending the notion of bundle we show how to define the strand-space operations directly on "bundle spaces". This leads to a characterisation of the largest congruence within the strand-space equivalence. Finally, we relate strand spaces to event structures, a well known model for concurrency.