Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols

@inproceedings{Bistarelli2003RelatingPA,
  title={Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols},
  author={S. Bistarelli and Iliano Cervesato and Gabriele Lenzini and Fabio Martinelli},
  booktitle={MMM-ACNS},
  year={2003}
}
When formalizing security protocols, different specification languages support very different reasoning methodologies, whose results are not directly or easily comparable. Therefore, establishing clear mappings among different frameworks is highly desirable, as it permits various methodologies to cooperate by interpreting theoretical and practical results of one system in another. In this paper, we examine the non-trivial relationship between two general verification frameworks: multiset… 
Relating multiset rewriting and process algebras for security protocol analysis
TLDR
This paper examines the relationship between two general verification frameworks: multiset rewriting (MSR) and a process algebra inspired to CCS and the π-calculus and shows that the sublanguages needed to specify cryptographic protocols admit an effective translation that is not only trace-preserving, but also induces a correspondence relation between the two languages.
A comparison between strand spaces and multiset rewriting for security protocol analysis
TLDR
The relationship illustrated here between multiset rewriting specifications and strand spaces suggests refinements to both frameworks, and deepens the understanding of the Dolev-Yao model.
A Generalized Two-Phase Analysis of Knowledge Flows in Security Protocols
TLDR
The approach enables a generalized two- phase analysis and extends the two-phase theory by identifying the necessary and sufficient proper- ties of a broad class of cryptographic primitives for which the theory holds.
Knowledge Flow Analysis for Security Protocols
TLDR
A generic framework in the Alloy modelling language is presented, and instantiated for two standard protocols, and a new key management scheme.
Multiset Rewriting and Security Protocol Analysis
TLDR
The multiset rewriting approach to security protocol analysis is described, algorithmic upper and lower bounds on specific forms of protocol analysis, and some of the ways this model is useful for formalizing sublte properties of specific protocols are described.
Computer Science and Artificial Intelligence Laboratory Knowledge Flow Analysis for Security Protocols
TLDR
A generic framework in the Alloy modelling language is presented, and instantiated for two standard protocols, and a new key management scheme.
Verifying Security Protocols: An Application of CSP
TLDR
This paper describes one such approach, based on theorem-proving, that uses the idea of a rank function to establish the correctness of protocols, and shows how it can be used to locate this flaw and prove that a modified version of the protocol is correct.
Integration of Analysis Techniques in Security and Fault-Tolerance
TLDR
This thesis focuses on the study of integration of formal methodologies in security protocol analysis and fault-tolerance analysis, and searches for connections among different approaches of analysis within the security area.

References

SHOWING 1-10 OF 35 REFERENCES
Relating multiset rewriting and process algebras for security protocol analysis
TLDR
This paper examines the relationship between two general verification frameworks: multiset rewriting (MSR) and a process algebra inspired to CCS and the π-calculus and shows that the sublanguages needed to specify cryptographic protocols admit an effective translation that is not only trace-preserving, but also induces a correspondence relation between the two languages.
Relating Process Algebras and Multiset Rewriting for Security Protocol Analysis
TLDR
This paper examines the nontrivial relationship between two general verification frameworks: multiset rewriting (MSR) and a process algebra inspired to the CCS and the π-calculus and shows that in the specific context of cryptographic protocols they do admit effective translations that preserve traces.
Relating strands and multiset rewriting for security protocol analysis
TLDR
The strand formalism is extended with a way of incrementally growing bundles in order to emulate an execution of a protocol with parametric strands and directly relates the intruder theory from the multiset rewriting formalism to the penetrator strands.
A meta-notation for protocol analysis
TLDR
This paper uses a multiset rewriting formalism, based on linear logic, to state the basic assumptions of this model, and defines a class of theories that correspond to finite-length protocols, with a bounded initialization phase but allowing unboundedly many instances of each protocol role.
Verifying Authentication Protocols in CSP
TLDR
The paper aims to develop a specific theory appropriate to the analysis of authentication protocols, built on top of the general CSP semantic framework.
Events in security protocols
TLDR
The net semantics is formally related to a transition semantics, strand spaces and inductive rules, as well as trace languages and event structures, so unifying a range of approaches, aswell as providing conditions under which particular, more limited, models are adequate for the analysis of protocols.
The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties
TLDR
An application in the area of network security is presented: it is shown that the theory (and the tool) can be reasonably applied also for singling out security flaws in a simple, yet paradigmatic, communication protocol.
Computing symbolic models for verifying cryptographic protocols
  • M. Fiore, M. Abadi
  • Computer Science, Mathematics
    Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.
  • 2001
TLDR
An algorithm that given a finite process describing a protocol in a hostile environment (trying to force the system into a "bad" state) computes a model of traces on which security properties can be checked and is sound for protocols with shared-key encryption/decryption that use arbitrary messages as keys.
A Bisimulation Method for Cryptographic Protocols
TLDR
This work proves the soundness of the bisimulation proof technique within the spi calculus, an extension of the pi calculus with cryptographic primitives, which yields proofs of classical security properties of protocols and also justifies certain protocol optimizations.
Higher-Order Quantification and Proof Search
TLDR
This paper will present several example of how reasoning directly on a logic program can benefit significantly if higher-order quantification is used to provide abstractions.
...
...