QUT ePrints

Examining Indistinguishability-Based Proof Models for Key Establishment Protocols

Choo, Kim-Kwang R., Boyd, Colin A., & Hitchcock, Yvonne (2005) Examining Indistinguishability-Based Proof Models for Key Establishment Protocols. Lecture Notes in Computer Science, 3788/2005, pp. 585-604.

View at publisher

Abstract

We examine various indistinguishability-based proof models for key establishment protocols, namely the Bellare & Rogaway (1993,1995), the Bellare, Pointcheval, & Rogaway (2000), and the Canetti & Krawczyk (2001) proof models. We then consider several variants of these proof models, identify several subtle differences between these variants and models, and compare the relative strengths of the notions of security between the models. For each of the pair of relations between the models (either an implication or a non-implication), we provide proofs or counter-examples to support the observed relations. We also reveal a drawback with the original formulation of the Bellare, Pointcheval, & Rogaway (2000) model, whereby the Corrupt query is not allowed. As a case study, we use the Abdalla & Pointcheval (2005) three-party password-based key exchange protocol (3PAKE), which carries a proof of security in the Bellare, Pointcheval, & Rogaway (2000) model. We reveal a previously unpublished flaw in the protocol, and demonstrate that this attack would not be captured in the model due to the omission of the Corrupt query.

Impact and interest:

68 citations in Scopus
Search Google Scholar™
59 citations in Web of Science®

Citation countsare sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

589 since deposited on 10 Oct 2005
81 in the past twelve months

Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 2181
Item Type: Journal Article
Keywords: Key Establishment Protocols, Provable Security, Bellare, Rogaway Model, Canetti, Krawczyk Model, Key Agreement Protocols, Indistinguishability, Based Proof Models
DOI: 10.1007/11593447_32
ISBN: 9783540306849
ISSN: 1611-3349
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000)
Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
Copyright Owner: Copyright 2005 Springer
Copyright Statement: This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink. http://www.springer.de/comp/lncs/ Lecture Notes in Computer Science
Deposited On: 10 Oct 2005
Last Modified: 29 Feb 2012 23:14

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page