A Proof Theoretic Analysis of Intruder Theories
From MaRDI portal
Publication:5902125
DOI10.1007/978-3-642-02348-4_8zbMath1201.68051MaRDI QIDQ5902125
Publication date: 30 June 2009
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.312.9404
68P25: Data encryption (aspects in computer science)
03B35: Mechanization of proofs and logical operations
03F05: Cut-elimination and normal-form theorems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An NP decision procedure for protocol insecurity with XOR
- Unification in a combination of arbitrary disjoint equational theories
- Deciding knowledge in security protocols under equational theories
- Intruder deduction for the equational theory of abelian groups with distributive encryption
- Easy intruder deduction problems with homomorphisms
- Unification in the union of disjoint equational theories: Combining decision procedures
- Symbolic protocol analysis for monoidal equational theories
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Combining Algorithms for Deciding Knowledge in Security Protocols
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- A practical secret voting scheme for large scale elections
- Programming Languages and Systems