Hierarchical combination of intruder theories

DOI10.1016/J.IC.2007.07.004MaRDI QIDQ2482450zbMATH OpenOpenAlexFDO

Authors Yannick Chevalier, Michaël Rusinowitch

Publication date 16 April 2008

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2007.07.004

zbMATH Keywords

combination of decision procedurescryptographic protocolsDolev-Yao intruderequational theories

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25)

Recommendations

• Hierarchical Combination of Intruder Theories
• Automata, Languages and Programming
• Term Rewriting and Applications
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
• A proof theoretic analysis of intruder theories

Cites work

• Automata, Languages and Programming
• Automatic recognition of tractability in inference relations
• Deciding knowledge in security protocols under equational theories
• Easy intruder deductions
• Foundations of Software Science and Computation Structures
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 4016226 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1948405 (Why is no real title available?)
• scientific article; zbMATH DE number 2043528 (Why is no real title available?)
• scientific article; zbMATH DE number 1754628 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• On the security of public key protocols
• On the symbolic reduction of processes with cryptographic functions.
• Programming Languages and Systems
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• STACS 2004
• Term Rewriting and Applications
• Term Rewriting and Applications
• The NRL Protocol Analyzer: An Overview
• Unification in a combination of arbitrary disjoint equational theories
• Unification in the union of disjoint equational theories: Combining decision procedures

Cited in

(8)

• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Hierarchical Combination of Intruder Theories
• Deciding equivalence-based properties using constraint solving
• Reducing equational theories for the decision of static equivalence
• Decidability and combination results for two notions of knowledge in security protocols
• Computing knowledge in equational extensions of subterm convergent theories
• Automata, Languages and Programming

Describes a project that uses

Uses Software

• NRL

This page was built for publication: Hierarchical combination of intruder theories

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