Self-Certified Ring Signcryption Scheme Based on Discrete Logarithm Problem

Abstract:

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.

• Periodical: Advanced Materials Research (Volumes 989-994)
• Pages: 4409-4412
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.989-994.4409
• Online since: July 2014
• Authors: Hai Shen Qin*, Zhong Xia Jiang, Mao Kui Geng, Jie Luo, Shu Lun Zhou
• Keywords: Bilinear Parings, Discrete Logarithm Problem, Ring Singcryption, Self-Certified Public Key Cryptology

References

[1] Rivest R L, Shamir A, Tauman Y. How to leak a Secret[c]. Advances in Cryptolopy-Asiacrypt'01, Springer-Verlag, Berlin, 2001: 552-565.

DOI: 10.1007/3-540-45682-1_32

[2] Zheng Y. Digital signcryption or how to achieve cost ( signature ＆ encryption)［C］. Advances in Cryptology－CRYPTO＇97，LNCS1294． Berlin: Springer－Verlag, 1997: 165－179.

DOI: 10.1007/bfb0052234

[3] M. Girault. Self-certified public keys[C]. Advances in Cryptology-EUROCRYPT' 91, LNCS547, Berlin: Springer-Verlag, 1991: 491-497.

DOI: 10.1007/3-540-46416-6_42

[4] Hongxia Hou, Yefeng Hou. A new certificateless ring signcryption scheme[J]. Computer Technology and Development, 2012, 22(7): 151-153.

[5] Huifang Yu, Bo Yang, Yi Zhao, Jiali Dang. Tag-KEM for Self-certified Ring Signcryption[J]. Journal of Computational Information Systems 9: 20 (2013) 8061-8071.