Easy intruder deductions

DOI10.1007/B12001zbMATH Open1201.68049OpenAlexW2483649756MaRDI QIDQ5305643FDOQ5305643

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

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

Mathematics Subject Classification ID

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

Cited In (15)

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

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)