earticle

논문검색

Efficient design of Certificateless Chameleon Signature from Bilinear Pairing

초록

영어

Certificateless public key cryptography (CL-PKC), does not require the use of the certificate to guarantee the authenticity of public keys. It does rely upon the use of a trusted third party (TTP), who is in possession of a master key. CL-PKC does not suffer from the key escrow property. Thus, CL-PKC can be seen as a model for the use in public key cryptography. In this paper, we proposed a new certificateless Chameleon signature scheme based on bilinear pairings. The proposed scheme is more efficient than AL-Riyami and Pateson [10] schemes. And our scheme is un-forgeable under the hardness assumption of the q-strong Diffie-Hellman problem and Computational Diffie-Hellman problem.

목차

Abstract
 1. Introduction
 2. Background Concepts
 3. Proposed Scheme
 4. Security Analysis
  4.1. Correctness.
  4.2. Verifiability.
 5. Efficiency
 7. Conclusion
 Acknowledgements
 References

저자정보

  • Tejeshwari Thakur School of Studies in Mathematics, Pt. Ravishankar Shukla University Raipur (C.G.), India
  • Neetu Sharma School of Studies in Mathematics, Pt. Ravishankar Shukla University Raipur (C.G.), India
  • Birendra Kumar Sharma School of Studies in Mathematics, Pt. Ravishankar Shukla University Raipur (C.G.), India

참고문헌

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

    함께 이용한 논문

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

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