Verification: Theory and Practice
From MaRDI portal
Publication:5305643
DOI10.1007/B12001zbMath1201.68049OpenAlexW2483649756MaRDI QIDQ5305643
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
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)
Related Items (13)
The Complexity of Disjunction in Intuitionistic Logic ⋮ Model Checking Security Protocols ⋮ Deciding knowledge in security protocols under equational theories ⋮ Intruder deduction for the equational theory of abelian groups with distributive encryption ⋮ Unification modulo homomorphic encryption ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Symbolic protocol analysis for monoidal equational theories ⋮ Hierarchical combination of intruder theories ⋮ Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures ⋮ Locality Results for Certain Extensions of Theories with Bridging Functions ⋮ Easy intruder deduction problems with homomorphisms ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
This page was built for publication: Verification: Theory and Practice
