Examining indistinguishability-based proof models for key establishment protocols

  • Authors:
  • Kim-Kwang Raymond Choo;Colin Boyd;Yvonne Hitchcock

  • Affiliations:
  • Information Security Institute, Queensland University of Technology, Brisbane, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Australia

  • Venue:
  • ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.