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

@article{Lafourcade2007IntruderDF,
  title={Intruder deduction for the equational theory of Abelian groups with distributive encryption},
  author={Pascal Lafourcade and Denis Lugiez and Ralf Treinen},
  journal={Inf. Comput.},
  year={2007},
  volume={205},
  pages={581-623}
}
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… CONTINUE READING