Symbolic protocol analysis with products and Diffie-Hellman exponentiation
- 23 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A security analysis of the cliques protocols suitesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An NP decision procedure for protocol insecurity with XORPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Mechanized proofs for a recursive authentication protocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constraint solving for bounded-process cryptographic protocol analysisPublished by Association for Computing Machinery (ACM) ,2001
- Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsPublished by Springer Nature ,2001
- Computing symbolic models for verifying cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Verifying security protocols with BrutusACM Transactions on Software Engineering and Methodology, 2000
- The inductive approach to verifying cryptographic protocolsJournal of Computer Security, 1998
- An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine EquationsInformation and Computation, 1994
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978