Formal Verification of Cryptographic Protocols

[1]  Stéphanie Delaune,et al.  A decision procedure for the verification of security protocols with explicit destructors , 2004, CCS '04.

[2]  Mathieu Baudet,et al.  Deciding security of protocols against off-line guessing attacks , 2005, CCS '05.

[3]  Véronique Cortier,et al.  Computationally sound implementations of equational theories against passive adversaries , 2005, Inf. Comput..

[4]  Pascal Lafourcade,et al.  Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or , 2006, ICALP.

[5]  Zohar Manna,et al.  Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday , 2004 .

[6]  Michaël Rusinowitch,et al.  Protocol insecurity with finite number of sessions is NP-complete , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[7]  Jonathan K. Millen,et al.  On the freedom of decryption , 2003, Inf. Process. Lett..

[8]  Vitaly Shmatikov,et al.  Intruder deductions, constraint solving and insecurity decision in presence of exclusive or , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[9]  Gavin Lowe,et al.  An Attack on the Needham-Schroeder Public-Key Authentication Protocol , 1995, Inf. Process. Lett..

[10]  Vitaly Shmatikov,et al.  Constraint solving for bounded-process cryptographic protocol analysis , 2001, CCS '01.

[11]  Martín Abadi,et al.  Deciding knowledge in security protocols under equational theories , 2004, Theor. Comput. Sci..

[12]  Yannick Chevalier,et al.  An NP decision procedure for protocol insecurity with XOR , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[13]  Yannick Chevalier,et al.  Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents , 2003, FSTTCS.

[14]  John C. Mitchell,et al.  Multiset rewriting and the complexity of bounded security protocols , 2004, J. Comput. Secur..

[15]  Sandro Etalle,et al.  An Improved Constraint-Based System for the Verification of Security Protocols , 2002, SAS.

[16]  Ralf Treinen,et al.  Easy Intruder Deductions , 2003, Verification: Theory and Practice.

[17]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[19]  Vitaly Shmatikov,et al.  Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation , 2005, J. Comput. Secur..

[20]  Catherine A. Meadows,et al.  On the Relative Soundness of the Free Algebra Model for Public Key Encryption , 2005, ARSPA@IJCAR.

[21]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[22]  Martín Abadi,et al.  Deciding knowledge in security protocols under (many more) equational theories , 2005, 18th IEEE Computer Security Foundations Workshop (CSFW'05).

[23]  Bruno Blanchet,et al.  An efficient cryptographic protocol verifier based on prolog rules , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..