Challenges in the Automated Verification of Security Protocols
From MaRDI portal
Publication:3541719
DOI10.1007/978-3-540-71070-7_34zbMath1165.68403OpenAlexW1901741109MaRDI QIDQ3541719
Publication date: 27 November 2008
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_34
Related Items
Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Locality Results for Certain Extensions of Theories with Bridging Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An NP decision procedure for protocol insecurity with XOR
- An attack on the Needham-Schroeder public-key authentication protocol
- Deciding knowledge in security protocols under equational theories
- Easy intruder deduction problems with homomorphisms
- Verification of cryptographic protocols: tagging enforces termination
- Tree automata with one memory set constraints and cryptographic protocols
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Security properties: two agents are sufficient
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Automated verification of selected equivalences for security protocols
- Symbolic protocol analysis for monoidal equational theories
- Automated complexity analysis based on ordered resolution
- The NRL Protocol Analyzer: An Overview
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Protocol Verification Via Rigid/Flexible Resolution
- Combining Algorithms for Deciding Knowledge in Security Protocols
- Hierarchical Combination of Intruder Theories
- Deducibility Constraints, Equational Theory and Electronic Money
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- Mobile values, new names, and secure communication
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Automatic recognition of tractability in inference relations
- Verification: Theory and Practice
- Algebraic Intruder Deductions
- Advances in Cryptology - CRYPTO 2003
- Intruders with Caps
- Safely Composing Security Protocols
- From One Session to Many: Dynamic Tags for Security Protocols
- Term Rewriting and Applications
