Skip to main content
Article thumbnail
Location of Repository

A Resolution Strategy for Verifying Cryptographic Protocols with CBC Encryption and Blind Signatures ∗ ABSTRACT

By Véronique Cortier and Loria Nancy

Abstract

Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing. In this paper, we consider more complex, less studied cryptographic primitives like CBC encryption and blind signatures. This leads us to introduce a new fragment of Horn clauses. We show decidability of this fragment using a combination of several resolution strategies. As a consequence, we obtain a new decidability result for a class of cryptographic protocols (with an unbounded number of sessions and a bounded number of nonces) that may use for example CBC encryption and blind signatures. We apply this result to fix the Needham-Schroeder symmetric key authentication protocol, which is known to be flawed when CBC mode is used

Topics: Verification, Security, Theory Keywords Verification, Cryptographic Protocols, Horn Clauses, Resolution Strategies
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9287
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.avispa-project.org/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.