Easy intruder deduction problems with homomorphisms

DOI10.1016/j.ipl.2005.11.008zbMath1184.68459OpenAlexW2081719098MaRDI QIDQ1045939

Stéphanie Delaune

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.008

zbMATH Keywords

formal methodsautomatic theorem provingsecurity protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (10)

Intruder deduction for the equational theory of abelian groups with distributive encryption ⋮ Deciding Knowledge in Security Protocols for Monoidal Equational Theories ⋮ Unnamed Item ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ Symbolic protocol analysis for monoidal equational theories ⋮ Locality Results for Certain Extensions of Theories with Bridging Functions ⋮ A Proof Theoretic Analysis of Intruder Theories ⋮ Deciding knowledge in security protocols under some e-voting theories

Cites Work

• Unnamed Item
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Receipt-free secret-ballot elections (extended abstract)
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• On the security of public key protocols
• Ideal membership in polynomial rings over the integers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Automatic recognition of tractability in inference relations
• Verification: Theory and Practice
• Term Rewriting and Applications

This page was built for publication: Easy intruder deduction problems with homomorphisms