In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a procedure for both problems under arbitrary convergent equational theories. Our procedure terminates on a wide range of equational theories. In particular, we obtain a new decidability result for a theory we encountered when studying electronic voting protocols. We also provide a prototype implementation. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Ciobâcǎ, Ş., Delaune, S., & Kremer, S. (2009). Computing knowledge in security protocols under convergent equational theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5663 LNAI, pp. 355–370). https://doi.org/10.1007/978-3-642-02959-2_27
Mendeley helps you to discover research relevant for your work.