Self-Certified Ring Signcryption Scheme Based on Discrete Logarithm Problem
暂无分享,去创建一个
This paper analyzes and summarizes existing ring signcryption schemes, combined with self-certified cryptosystem and ring signcrypption, we proposed a self-certified ring signcryption based on Discrete Logarithm Problem. The scheme proposed not only guaranties ring signcrption’s anonymity, confidentiality, unforgeability and other security features, but also solves certificate management and key escrow issues, which can save storage space and communication cost. By removing bilinear pairings in the process of design, the efficiency of this scheme has been greatly improved. Concluded from the experimental results, this scheme has the advantages of high computational efficiency, high security, and low communication cost.
[1] Yael Tauman Kalai,et al. How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.
[2] Marc Girault,et al. Self-Certified Public Keys , 1991, EUROCRYPT.
[3] Yuliang Zheng,et al. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.
[4] He Ye-feng. A New Certificateless Ring Signcryption Scheme , 2012 .