An E-unification algorithm for analyzing protocols that use modular exponentiation (2003)

Cached

Download Links

by Deepak Kapur , Paliath Narendran , Lida Wang
Citations:20 - 0 self

Documents Related by Co-Citation

1044 On the Security of Public Key Protocols – Danny Dolev, et al. - 1983
54 Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents – Yannick Chevalier, Ralf Küsters, Michael Rusinowitch, Mathieu Turuani - 2003
72 Intruder deductions, constraint solving and insecurity decision in presence of exclusive or – H. Comon-Lundh, V. Shmatikov - 2003
83 An NP Decision Procedure for Protocol Insecurity with XOR – Yannick Chevalier, Ralf Küsters, Michael Rusinowitch, Mathieu Turuani - 2003
27 A Unification Algorithm for the Group Diffie-Hellman Protocol – Catherine Meadows , Paliath Narendran - 2002
216 Unification Theory – Franz Baader, Wayne Snyder - 2001
71 Tree Automata With One Memory, Set Constraints and Cryptographic Protocols – Hubert Comon
20 A decision procedure for the verification of security protocols with explicit destructors – S Delaune, F Jacquemard - 2004
249 An Efficient Cryptographic Protocol Verifier Based on Prolog Rules – Bruno Blanchet - 2001
138 Constraint Solving for Bounded-Process Cryptographic Protocol Analysis – Jonathan Millen, Vitaly Shmatikov - 2001
36 Symbolic protocol analysis with products and Diffie-Hellman exponentiation – Jonathan Millen, Vitaly Shmatikov - 2003
81 Deciding knowledge in security protocols under equational theories – Martín Abadi, Véronique Cortier - 2004
39 The finite variant property: How to get rid of some algebraic properties – Hubert Comon-lundh, Stéphanie Delaune, France Télécom R - 2005
2693 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
83 Symbolic Trace Analysis of Cryptographic Protocols – Michele Boreale
56 A Security Analysis of the Cliques Protocols Suites – Olivier Pereira, Jean-Jacques Quisquater - 2001
148 Protocol insecurity with finite number of sessions is NP-complete – Michaël Rusinowitch, Mathieu Turuani - 2001
76 On the symbolic reduction of processes with cryptographic functions – R Amadio, D Lugiez, V Vanackère
50 A survey of algebraic properties used in cryptographic protocols – V Cortier, S Delaune, P Lafourcade