Comparing the pre- and post-specified peer models for key agreement. (26th February 2009)

• Record Type: Journal Article
• Authors: Menezes, Alfred; Ustaoglu, Berkant
• Is Part Of: International journal of applied cryptography. Volume 1:Number 3(2009)
• Page Start: 236
• Page End: 250
• Publication Date: 2009-02-26
• Subjects: key agreement protocols -- cryptography -- pre-specified peer models -- post-specified peer models -- security assurances; Data encryption (Computer science) -- Periodicals; Cryptography -- Periodicals; Computer security -- Periodicals; 652.8
• Languages: English
• ISSNs: 1753-0563

Abstract

In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this article, we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in the pre- and post-specified peer models. We give examples of protocols that are secure in one model, but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and post-specified peer models.