An NP decision procedure for protocol insecurity with XOR
From MaRDI portal
(Redirected from Publication:557799)
Recommendations
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- On the Automatic Analysis of Recursive Security Protocols with XOR
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Automatic Analysis of the Security of XOR-Based Key Management Schemes
Cites work
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 2043528 (Why is no real title available?)
- scientific article; zbMATH DE number 1927582 (Why is no real title available?)
- scientific article; zbMATH DE number 1927583 (Why is no real title available?)
- scientific article; zbMATH DE number 1754628 (Why is no real title available?)
- scientific article; zbMATH DE number 1754629 (Why is no real title available?)
- scientific article; zbMATH DE number 1759624 (Why is no real title available?)
- scientific article; zbMATH DE number 1903362 (Why is no real title available?)
- An NP decision procedure for protocol insecurity with XOR
- An attack on a recursive authentication protocol. A cautionary tale
- An attack on the Needham-Schroeder public-key authentication protocol
- Deciding the security of protocols with commuting public key encryption
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On the security of public key protocols
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Using encryption for authentication in large networks of computers
Cited in
(37)- A method for symbolic analysis of security protocols
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis
- Automated Deduction – CADE-20
- Challenges in the Automated Verification of Security Protocols
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
- On the Automatic Analysis of Recursive Security Protocols with XOR
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- An NP decision procedure for protocol insecurity with XOR
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
- The gap between promise and reality: on the insecurity of XOR arbiter PUFs
- Decidability and combination results for two notions of knowledge in security protocols
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- scientific article; zbMATH DE number 7559487 (Why is no real title available?)
- On the semantics of Alice \& Bob specifications of security protocols
- Automatic Analysis of the Security of XOR-Based Key Management Schemes
- Crooked indifferentiability of enveloped XOR revisited
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- Deciding knowledge in security protocols under equational theories
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- A Proof Theoretic Analysis of Intruder Theories
- Deciding knowledge in security protocols under some e-voting theories
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- Bounded memory protocols
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Symbolic protocol analysis for monoidal equational theories
- Satisfiability of general intruder constraints with and without a set constructor
- Computing knowledge in equational extensions of subterm convergent theories
- Bounded memory Dolev-Yao adversaries in collaborative systems
This page was built for publication: An NP decision procedure for protocol insecurity with XOR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557799)
