Easy intruder deductions

DOI10.1007/B12001MaRDI QIDQ5305643zbMATHOpenAlexFDO

Authors Hubert Comon-Lundh, Ralf Treinen

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Easy intruder deduction problems with homomorphisms
• Algebraic Intruder Deductions
• Term Rewriting and Applications
• A proof theoretic analysis of intruder theories
• A Proof Theoretic Analysis of Intruder Theories

Cited in

(15)

• Challenges in the Automated Verification of Security Protocols
• Hierarchical combination of intruder theories
• Algebraic Intruder Deductions
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Decidability and combination results for two notions of knowledge in security protocols
• Unification modulo homomorphic encryption
• The complexity of disjunction in intuitionistic logic
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Easy intruder deduction problems with homomorphisms
• Deciding knowledge in security protocols under equational theories
• Model Checking Security Protocols
• Locality Results for Certain Extensions of Theories with Bridging Functions
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
• scientific article; zbMATH DE number 2080671 (Why is no real title available?)
• Symbolic protocol analysis for monoidal equational theories

This page was built for publication: Easy intruder deductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305643)