earticle

논문검색

An Improved ID-based Proxy Signature Scheme with Message Recovery

원문정보

초록

영어

In 2012, Singh and Verma proposed an ID-based proxy signature scheme with message recovery. In this paper, we show that their scheme is vulnerable to the forgery attack, and an adversary can forge a valid proxy signature for any message with knowing a previous valid proxy signature. In addition, there is a security flaw in their proof. Furthermore, we propose an improved scheme that remedies the weakness of their scheme, and the improved scheme can be proved existentially unforgeable-adaptively chosen message and ID attack assuming the computational Diffie-Hellman problem is hard.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Preliminaries
  3.1. Bilinear Pairing
  3.2. Computational Diffie-hellmen Problem (CDHP)
  3.3. Syntax of ID-based Proxy Signature Scheme with Message Recovery
  3.4. Security Model of ID-based Proxy Signature Scheme with Message Recovery
 4. Review of Singh and Verma’s Scheme
  4.1. Notations
  4.2. Singh and Verma’s Scheme
  4.3. A Forgery Attack on Singh and Verma’s Scheme
  4.4. The Security Flaw in the Proof of Singh and Verma’s Scheme
 5. An Improved Scheme
  5.1. The Scheme
 6. Security and Efficiency Analysis of the Improved Scheme
  6.1. Security Analysis
  6.2. Efficiency Analysis
 7. Conclusion and Future Work
 Acknowledgements
 References

저자정보

  • Caixue Zhou School of Information Science and Technology, University of Jiujiang, JiuJiang, 332005, JiangXi, P.R. China

참고문헌

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

    함께 이용한 논문

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

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