Efficient anonymous roaming and its security analysis

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

11 Scopus Citations
View graph of relations

Author(s)

  • Guomin Yang
  • Duncan S. Wong
  • Xiaotie Deng

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)334-349
Journal / PublicationLecture Notes in Computer Science
Volume3531
Publication statusPublished - 2005

Conference

TitleThird International Conference on Applied Cryptography and Network Security, ACNS 2005
PlaceUnited States
CityNew York, NY
Period7 - 10 June 2005

Abstract

The Canetti-Krawczyk (CK) model uses resuable modular components to construct indistinguishability-based key exchange protocols. The reusability of modular protocol components makes it easier to construct and prove new protocols when compared with other provably secure approaches. In this paper, we build an efficient anonymous and authenticated key exchange protocol for roaming by using the modular approach under the CK-model. Our protocol requires only four message flows and uses only standard cryptographic primitives. We also propose a one-pass counter based MT-authenticator and show its security under the assumption that there exists a MAC which is secure against chosen message attack. © Springer-Verlag Berlin Heidelberg 2005.

Research Area(s)

  • Anonymous Roaming, Authenticated Key Exchange

Citation Format(s)

Efficient anonymous roaming and its security analysis. / Yang, Guomin; Wong, Duncan S.; Deng, Xiaotie.

In: Lecture Notes in Computer Science, Vol. 3531, 2005, p. 334-349.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review