A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
From MaRDI portal
Publication:3586076
DOI10.1007/978-3-642-15155-2_11zbMath1287.94050OpenAlexW2156070309MaRDI QIDQ3586076
No author found.
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_11
Cryptography (94A60) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) ⋮ The Complexity of Disjunction in Intuitionistic Logic ⋮ Satisfiability of general intruder constraints with and without a set constructor
This page was built for publication: A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
