Automata, Languages and Programming
From MaRDI portal
Publication:5466517
DOI10.1007/b99859zbMath1099.94026OpenAlexW2505584480MaRDI QIDQ5466517
Martín Abadi, Véronique Cortier
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Decidability of theories and sets of sentences (03B25) Authentication, digital signatures and secret sharing (94A62)
Related Items
Deciding knowledge in security protocols under equational theories, Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks, Intruder deduction for the equational theory of abelian groups with distributive encryption, To know or not to know: Epistemic approaches to security protocol verification, Computing knowledge in equational extensions of subterm convergent theories, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Computationally sound implementations of equational theories against passive adversaries, An algebraic approach to the verification of a class of Diffie-Hellman protocols, Limits of the Cryptographic Realization of Dolev-Yao-Style XOR, A Logical Characterisation of Static Equivalence