A Proof Theoretic Analysis of Intruder Theories
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages F under the theory of blind signatures and arbitrary convergent equational theories modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like systems and proving decidability requires significant effort in showing that the rules...[Show more]
|Collections||ANU Research Publications|
|Source:||RTA 2009: Proceedings of the International Conference on Rewriting Techniques & Applications|
|01_Tiu_A_Proof_Theoretic_Analysis_of_2009.pdf||377.62 kB||Adobe PDF||Request a copy|
|02_Tiu_A_Proof_Theoretic_Analysis_of_2009.pdf||95.16 kB||Adobe PDF||Request a copy|
|03_Tiu_A_Proof_Theoretic_Analysis_of_2009.pdf||525.98 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.