Pages that link to "Item:Q557799"
From MaRDI portal
The following pages link to An NP decision procedure for protocol insecurity with XOR (Q557799):
Displaying 33 items.
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- The gap between promise and reality: on the insecurity of XOR arbiter PUFs (Q1695908) (← links)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404) (← links)
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem (Q2304983) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables (Q3631368) (← links)
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (Q3636822) (← links)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
- YAPA: A Generic Tool for Computing Intruder Knowledge (Q3636824) (← links)
- (Q5089298) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography (Q5458826) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
- Crooked indifferentiability of enveloped XOR revisited (Q6157572) (← links)
