Foundations of Software Science and Computation Structures

DOI10.1007/B95995MaRDI QIDQ5308437zbMATH OpenOpenAlexFDO

Authors Hubert Comon-Lundh

Publication date 28 September 2007

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

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2080671
• Automata, Languages and Programming
• A proof theoretic analysis of intruder theories
• A Proof Theoretic Analysis of Intruder Theories
• Intruders with Caps

Cited in

(11)

• Termination of narrowing revisited
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
• Symbolic protocol analysis for monoidal equational theories
• Hierarchical combination of intruder theories
• Modular Termination of Basic Narrowing
• scientific article; zbMATH DE number 2080671 (Why is no real title available?)
• Satisfiability of general intruder constraints with and without a set constructor
• Security abstractions and intruder models (extended abstract)
• Deciding knowledge in security protocols under equational theories
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• A compact fixpoint semantics for term rewriting systems

This page was built for publication: Foundations of Software Science and Computation Structures

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