Protocol Verification Via Rigid/Flexible Resolution
From MaRDI portal
Publication:3498469
DOI10.1007/978-3-540-75560-9_19zbMath1137.94342MaRDI QIDQ3498469
Stéphanie Delaune, Hai Lin, Christopher Lynch
Publication date: 15 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_19
94A60: Cryptography
Related Items
Rigid tree automata and applications, Challenges in the Automated Verification of Security Protocols, Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
Cites Work
- Unnamed Item
- Encoding First Order Proofs in SAT
- Tree Automata with Equality Constraints Modulo Equational Theories
- Theorem Proving via General Matings
- On the security of public key protocols
- Using encryption for authentication in large networks of computers
- A practical secret voting scheme for large scale elections