Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
From MaRDI portal
Publication:3636822
DOI10.1007/978-3-642-02348-4_9zbMath1242.94032OpenAlexW1480088287MaRDI QIDQ3636822
Kumar Neeraj Verma, Helmut Seidl
Publication date: 30 June 2009
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_9
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Decidability of theories and sets of sentences (03B25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
- An NP decision procedure for protocol insecurity with XOR
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- On the security of public key protocols
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Flat and one-variable clauses
- Automated Deduction – CADE-20
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automatic Analysis of the Security of XOR-Based Key Management Schemes
This page was built for publication: Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
