Intruder deduction for the equational theory of Abelian groups with distributive encryption

  • Authors:

  • Pascal Lafourcade;Denis Lugiez;Ralf Treinen

  • Affiliations:

  • LIF, Université Aix-Marseille 1 & CNRS UMR 6166, 39 rue Joliot Curie, 13013 Marseille Cedex, France and LSV, ENS de Cachan & CNRS UMR 8643 & INRIA Futurs project SECSI, 61 Avenue du Pré& ...;LIF, Université Aix-Marseille 1 & CNRS UMR 6166, 39 rue Joliot Curie, 13013 Marseille Cedex, France;LSV, ENS de Cachan & CNRS UMR 8643 & INRIA Futurs project SECSI, 61 Avenue du Pré& INRIA Futurs project SECSI, 61 Avenue du Préésident Wilson, 94235 Cachan Cede, France

  • Venue:
  • Information and Computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocols are based on rewriting techniques and automated deduction in order to implement or mimic the process calculus describing the execution of a protocol. We are interested in the intruder deduction problem, that is vulnerability to passive attacks in presence of equational theories which model the protocol specification and properties of the cryptographic operators. In the present paper, we consider the case where the encryption distributes over the operator of an Abelian group or over an exclusive-or operator. We prove decidability of the intruder deduction problem in both cases. We obtain a PTIME decision procedure in a restricted case, the so-called binary case. These decision procedures are based on a careful analysis of the proof system modeling the deductive power of the intruder, taking into account the algebraic properties of the equational theories under consideration. The analysis of the deduction rules interacting with the equational theory relies on the manipulation of Z-modules in the general case, and on results from prefix rewriting in the binary case.