Theory of linear and integer programming
Theory of linear and integer programming
Fast parallel computation of hermite and smith forms of polynomial matrices
SIAM Journal on Algebraic and Discrete Methods
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Key Distribution Protocol for Digital Mobile Communication Systems
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Unification in Monoidal Theories
Proceedings of the 10th International Conference on Automated Deduction
An NP Decision Procedure for Protocol Insecurity with XOR
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Verifiable secret-ballot elections
Verifiable secret-ballot elections
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Intruder deduction for AC-like equational theories with homomorphisms
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Hi-index | 0.89 |
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical Dolev-Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as Exclusive or and Abelian groups in combination with the homomorphism axiom. We show that the intruder deduction problem is in PTIME in both cases, improving the EXPTIME complexity results of Lafourcade, Lugiez and Treinen.