Deciding Hedged Bisimilarity
This addresses the need for automated verification of security properties like authentication and confidentiality in cryptographic protocols, though it is incremental as it builds on existing bisimilarity concepts.
The paper tackles the problem of verifying security properties in cryptographic protocols by providing an algorithm for deciding hedged bisimilarity on finite spi-calculus processes, which is equivalent to barbed equivalence and works with various encryption schemata.
The spi-calculus is a formal model for the design and analysis of cryptographic protocols: many security properties, such as authentication and strong confidentiality, can be reduced to the verification of behavioural equivalences between spi processes. In this paper we provide an algorithm for deciding hedged bisimilarity on finite processes, which is equivalent to barbed equivalence (and coarser than framed bisimilarity). This algorithm works with any term equivalence satisfying a simple set of conditions, thus encompassing many different encryption schemata.