earticle

논문검색

Efficient Certificateless Signcryption from Bilinear Pairings

원문정보

초록

영어

Certificateless public key cryptography is an attractive paradigm which combines advantages of both traditional certificate-based and ID-based public key cryptosystems. In this paper, the author formalizes the definition and the security model for certificateless signcryption (CLSC), and proposes a CLSC scheme that is proved to be secure in the random oracle model. The CLSC scheme satisfies such desirable properties as message confidentiality, signature unforgability, public verifiability and forward secrecy. Moreover, the scheme achieves significant efficiency in that it requires general cryptographic hash functions instead of the MapToPoint function which is inefficient and probabilistic, and the public/private key of a user in the scheme is a single group element, and it is unnecessary to check the validity of the public key, and signcryption algorithm needs no pairing operation while the reverse operation only requires two pairing computations.

목차

Abstract
 1. Introduction
 2. Preliminaries
 3. Frameworks of Certificateless Signcryption
 4. An Efficient Certificateless Signcryption Scheme
  4.1. The basic scheme
  4.2. Security
  4.3. Efficiency Analysis
 5. Conclusions
 Acknowledgements
 References

저자정보

  • Hongzhen Du School of Mathematics and Information Science, Baoji University of Arts and Sciences, Baoji, 721013, China

참고문헌

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

    함께 이용한 논문

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

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