Abstract
In this paper we present an efficient ID-based authenticated key agreement (AKA) protocol by using bilinear maps, especially well suited to unbalanced computing environments: an ID-based AKA protocol for Server and Client. Particularly, considering low-power clients' devices, we remove expensive operations such as bilinear maps from a client side. To achieve our goal we combine two notions, key agreement and ID-based authenticryption in which only designated verifier (or Sever) can verify the validity of a given transcript. We prove the security of our ID-based AKA protocols in the random oracle model.
Original language | English |
---|---|
Pages (from-to) | 494-505 |
Number of pages | 12 |
Journal | Lecture Notes in Computer Science |
Volume | 3574 |
DOIs | |
Publication status | Published - 2005 |
Event | 10th Australasian Conference on Information Security and Privacy, ACISP 2005 - Brisbane, Australia Duration: 2005 Jul 4 → 2005 Jul 6 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)