Automata, Languages and Programming
From MaRDI portal
Publication:5716815
DOI10.1007/11523468zbMath1084.94512OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716815
Michaël Rusinowitch, Yannick Chevalier
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (10)
Deciding knowledge in security protocols under equational theories ⋮ Intruder deduction for the equational theory of abelian groups with distributive encryption ⋮ Deciding Knowledge in Security Protocols for Monoidal Equational Theories ⋮ Decidability of equivalence of symbolic derivations ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Satisfiability of general intruder constraints with and without a set constructor ⋮ Symbolic protocol analysis for monoidal equational theories ⋮ Hierarchical combination of intruder theories ⋮ Compiling and securing cryptographic protocols ⋮ Key Substitution in the Symbolic Analysis of Cryptographic Protocols
This page was built for publication: Automata, Languages and Programming
