Intruder deduction problem for locally stable theories with normal forms and inverses

Ayala-Rincón, Maurício; Fernández, Maribel; Nantes-Sobrinho, Daniele

doi:10.1016/j.tcs.2017.01.027

Cited by 4 publications

(5 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This example message theory is provided only to provide meaningful examples. also be devised not limited to: sub-term convergent theories [1]; blind signatures and homomorphic encryption [20]; and locally stable theories with inverses [9].…”

Section: An Example Message Term Language and Equational Theorymentioning

confidence: 99%

Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

Horne

Mauw

Yurkov

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied $$\pi $$ π -calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so.

show abstract

Section: An Example Message Term Language and Equational Theorymentioning

confidence: 99%

Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

Horne

Mauw

Yurkov

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…• Firstly, how can we define a bisimilarity congruence that can be used to reason about arbitrary message theories, not limited to xor [Ayala-Rincón et al 2017] and blind signatures [Bursuc et al 2014]? Existing work on open bisimilarity for the spi-calculus is hard wired to handle Dolev-Yao [Dolev and Yao 1983] symmetric encryption only.…”

Section: :2 Hornementioning

confidence: 99%

“…1 is for the purpose of meaningful examples. Further theories can also be devised not limited to: sub-term convergent theories [Abadi and Cortier 2006]; blind signatures and homomorphic encryption [Bursuc et al 2014]; and locally stable theories with inverses [Ayala-Rincón et al 2017].…”

Section: :2 Hornementioning

confidence: 99%

See 1 more Smart Citation

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

Horne

2018

Preprint

View full text Add to dashboard Cite

This paper is the first thorough investigation into the coarsest notion of bisimilarity for the applied π -calculus that is a congruence relation: open barbed bisimilarity. An open variant of labelled bisimilarity (quasi-open bisimilarity), better suited to constructing bisimulations, is proven to coincide with open barbed bisimilarity. These bisimilary congruences are shown to be characterised by an intuitionistic modal logic that can be used, for example, to describe an attack on privacy whenever a privacy property is violated. Open barbed bisimilarity provides a compositional approach to verifying cryptographic protocols, since properties proven can be reused in any context, including under input prefix. Furthermore, open barbed bisimilarity is sufficiently coarse for reasoning about security and privacy properties of cryptographic protocols; in constrast to the finer bisimilarity congruence, open bisimilarity, which cannot verify certain privacy properties.

show abstract

“…Much work has gone into investigating and developing decision procedures for the deduction and the static equivalence problems (Abadi and Cortier 2006;Ayala-Rincón et al, 2017;Baudet et al, 2013;Ciobâcȃ et al, 2012;Conchinha et al, 2011;Erbatur et al, 2017). In this line of research, the security protocols are often represented by equational theories usually defined as unions of several simpler sub-theories.…”

Section: Introductionmentioning

confidence: 99%

Computing knowledge in equational extensions of subterm convergent theories

Erbatur

Marshall

Ringeissen

2020

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We study decision procedures for two knowledge problems critical to the verification of security protocols, namely the intruder deduction and the static equivalence problems. These problems can be related to particular forms of context matching and context unification. Both problems are defined with respect to an equational theory and are known to be decidable when the equational theory is given by a subterm convergent term rewrite system (TRS). In this work, we extend this to consider a subterm convergent TRS defined modulo an equational theory, like Commutativity. We present two pairs of solutions for these important problems. The first solves the deduction and static equivalence problems in rewrite systems modulo shallow theories such as Commutativity. The second provides a general procedure that solves the deduction and static equivalence problems in subterm convergent systems modulo syntactic permutative theories, provided a finite measure is ensured. Several examples of such theories are also given.

show abstract

Intruder deduction problem for locally stable theories with normal forms and inverses

Cited by 4 publications

References 33 publications

Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

Computing knowledge in equational extensions of subterm convergent theories

Contact Info

Product

Resources

About