Earticle

초록

영어

In the paper, we analyze the security vulnerability of the key agreement protocol proposed by Lee et al.'s. We present a forgery attack to their protocol. In this attack, the adversary can modify the signed message and forge a new signature, which can pass the verification. Then, we propose a new group key agreement protocol, which overcomes this security drawback. The new protocol can be proved to be secure under Elliptic Curve Discrete Logarithm Problem, Bilinear Computational Diffie–Hellman Problem and Square-Exponent Problem. On the other hand, in the new protocol, only three pairing operations are used, so it is more efficient. Our protocol is also a contributory group key agreement protocol.

목차

Abstract
 1. Introduction
 2. Preliminary
  2.1. Bilinear Pairings
  2.2. Review of Lee’s Group Key Agreement Protocol
  2.3. Security Weakness of Lee’s Protocol
  2.4. Efficiency Analysis of Lee’s Protocol
 3. New Construction of Authenticated Key Agreement Protocol in Imbalanced Mobile Environment
 4. Discussions
  4.1. Correctness
  4.2. Security Analysis
  4.3. Performance Comparison
 5. Conclusions
 References

키워드

저자

• Xiangjun Xin [ School of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou 450002, China ]
• Chaoyang Li [ School of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou 450002, China ]
• Dongsheng Chen [ School of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou 450002, China ]
• Fagen Li [ School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605