Title: Comparing the pre- and post-specified peer models for key agreement
Authors: Alfred Menezes, Berkant Ustaoglu
Addresses: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada. ' Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
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.
Keywords: key agreement protocols; cryptography; pre-specified peer models; post-specified peer models; security assurances.
International Journal of Applied Cryptography, 2009 Vol.1 No.3, pp.236 - 250
Published online: 24 Feb 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article