Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 355-369
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Symbolic protocol analysis with products and Diffie-Hellman exponentiation2004
- Intruder deductions, constraint solving and insecurity decision in presence of exclusive or2003
- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation2003
- Mechanized proofs for a recursive authentication protocol2002
- Constraint solving for bounded-process cryptographic protocol analysis2001
- Symbolic Trace Analysis of Cryptographic ProtocolsLecture Notes in Computer Science, 2001
- Computing symbolic models for verifying cryptographic protocols2001
- Unification Theory2001
- On the Reachability Problem in Cryptographic Protocols2000
- An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine EquationsInformation and Computation, 1994