earticle

논문검색

On the Security of a Group Key Agreement Protocol and Its Improvement with Pairings

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.