Skip to Main content Skip to Navigation
Conference papers

Decidability of Deterministic Process Equivalence for Finitary Deduction Systems

Benito Fabian Romero Jimenez 1 Yannick Chevalier 1
1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
Abstract : Deciding privacy-type properties of deterministic cryptographic protocols such as anonymity and strong secrecy can be reduced to deciding the symbolic equivalence of processes, where each process is described by a set of possible symbolic traces. This equivalence is parameterized by a deduction system that describes which actions and observations an intruder can perform on a running system. We present in this paper a notion of finitary deduction systems. For this class of deduction system, we first reduce the problem of the equivalence of processes with no disequations to the resolution of reachability problem on each symbolic trace of one process, and then testing whether each solution found is solution of a related trace in the other process. We then extend this reduction to the case of generic deterministic finite processes in which symbolic traces may contain disequalities.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Hal Irit <>
Submitted on : Thursday, October 8, 2020 - 10:13:23 AM
Last modification on : Thursday, March 18, 2021 - 2:24:49 PM


Decidability of Deterministic ...
Files produced by the author(s)



Benito Fabian Romero Jimenez, Yannick Chevalier. Decidability of Deterministic Process Equivalence for Finitary Deduction Systems. 28th Euromicro International Conference on Parallel, Distributed and network-based Processing - PDP 2020, Mar 2020, Västerås, Sweden. pp.441-444, ⟨10.1109/PDP50117.2020.00074⟩. ⟨hal-02960354⟩



Record views


Files downloads