Verifying security protocols as planning in logic programming
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the relationship between strand spaces and multi-agent systems
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
A new logic for electronic commerce protocols
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Petri nets in cryptographic protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Higher-Order Quantification and Proof Search
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Typed MSR: Syntax and Examples
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
The Expressive Power of Horn Monadic Linear Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Multiset Constraints and P Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Information Processing Letters
Study on strand space model theory
Journal of Computer Science and Technology
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
Higher-Order and Symbolic Computation
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Privacy, abstract encryption and protocols: an ASM model - part I
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Verification of authentication protocols based on the binding relation
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A comparison between strand spaces and multiset rewriting for security protocol analysis
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
Handling exp, χ (and timestamps) in protocol analysis
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Verifying security protocols: an application of CSP
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
Formal analysis of security protocols is largely based on a set of assumptions commonly referred to as the Dolev-Yao model. Two formalisms that state the basic assumptions of this model are related here: strand spaces and multiset rewriting with existential quantification. Although it is intuitive that these two languages should be equivalent in some way, a number of modifications to each system are required to obtain a meaningful equivalence. We extend the strand formalism with a way of incrementally growing bundles in order to emulate an execution of a protocol with parametric strands. We omit the initialization part of the multiset rewriting setting, which formalizes the choice of initial data, such as shared public or private keys, and which has no counterpart in the strand space setting. The correspondence between the modified formalisms directly relates the intruder theory from the multiset rewriting formalism to the penetrator strands.