A Concrete Certi.cateless Signature Scheme without Pairings
Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in certificateless cryptography are built from bilinear mappings on elliptic curves which need costly operations. Despite the investigation of certificateless public key encryption without pairings, certificateless signature without pairings received much less attention than what it deserves. In this paper, we present a concrete pairing-free certificateless signature scheme for the first time. Our scheme is more computationally efficient than others built from pairings. The new scheme is provably secure in the random oracle model assuming the hardness of discrete logarithm problem.
certificateless signature bilinear pairing discrete logarithm problem random oracle model strongly secure
Aijun Ge Shaozhen Chen Xinyi Huang
Department of Applied Mathematics Zhengzhou Information Science and Technology Institute Zhengzhou, School of Computer Science and Software Engineering University of Wollongong Wollongong, NSW 2500, A
国际会议
武汉
英文
1046-1049
2009-11-18（万方平台首次上网日期，不代表论文的发表时间）