2017
DOI: 10.1016/j.tcs.2017.01.027
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on the Research Portal, if citing you are again advised to check the publisher's website for any subsequent corrections.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 33 publications
0
5
0
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%
“…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%
“…• 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
“…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%