Email this article A Novel Practical Certificate-Less Digital Signing System Based on Super-Elliptic Bilinear Map Parings
Abstract
Certificate-Less digital signing system based on bilinear map
pairings defined on super elliptic curve, which is proved
more efficiency than some similar systems pioneered heretofore as viewed from information security application widely applied in mobile-thin computation environment often with a narrow communication bandwidth concomitant. For a
long span, the complex managing public key certificate job
involved in crypto-system based on identity has been keeping from a more efficient digital signing and disturbing engineers engaging in designing secure mobile E-Commerce. By this scheme, signing subroutine can be in no need of pairscomputation, and verifying can be performed only at cost
of 3 times pairs-computation while not introducing special
hash function, a necessity in some similar schemes initiated
in some references. With respect to security, the system
manifests a satisfying immunity from Replacing Public Key
Attack, Forging Signature Attack and some other typical
attack methods from angle of computability of NP-problem
and of provable security. By comparison and analysis in
detail and in depth, it is made clear that the signing system
can provide a favorable macro-availability and performance,
and be fit to be promoted into the application of mobile ECommerce and some similar requirements.
Keywords
References
[1] H. X. Lai Xin and H. Dake, “An ID-Based Efficient Signcryption Key Encapsulation Scheme,” Journal of Computer Research and Development, vol. 46, no. 1, May 2009.
[2] M. W. Liu Jingwei, Sun Rong, “Efficient ID-based certificateless signature scheme,” Journal on Communications, vol. 29, no. 2, Feb. 2008.
[3] S. N. R. W. Baek J, “Certificateless pubic key encryption without pairing,” in Proceedings of the 8th International Conference of. Information Security, Mar. 2005.
[4] W. Q. Du Hongzhen, “Effieient and Provable-secure certificateless short signature scheme from bilinear Pairings,” Computer Standards and Interfaces, vol. 31, no. 2, Feb. 2009.
[5] D. H. Qiaoyan, “Efficient certificateless designated verifier signature and Proxy signatures,” Chinese Journal of Electronics, vol. 18, no. 1, Jan. 2009.
[6] W. Q. Du Hongzhen, “Efficient traceable identity-based signature scheme,” Journal on Communications, vol. 30, no. 8, Aug. 2009.
[7] Y. Y. Zhou Liang, Yang Wenzhong, “Proxy signature scheme with restricted signing capability,” Journal of Beijing University of Posts and Telecommunications, vol. 31, no. 3, Mar. 2008.
[8] L. J. Wang and R. C. Jonathan Jen, “Novel Digital Multisignature Scheme,” ICICExpress Letters, vol. 4, no. 4, 2010.
[9] R. L. Yuan Zhou, Zhenfu Cao, “Provably secure Proxy- Protected signature schemes based on factoring,” Applied Mathematics and Computation, vol. 164, no. 1, Jan. 2005.
[10] M. J. Zhang J, “A novel ID-based designated verifier signature scheme,” Information Science, vol. 17, no. 3, Mar. 2008.
[11] X. C. R. H. Jia Yu, Fanyu Kong, “A Forward Secure Threshold Signature Scheme Based on the Structure of Binary Tree,” Journal of Software, vol. 4, no. 1, Apr. 2009.
[12] Y. L. ChinChen Chang and J. Yang, “An Efficient Authenticated Encryption SchemeBased on Elliptic Curve Cryptosystem for Broadcast Environments,” ICIC Express Letters, vol. 4, no. 1, Jan. 2010.
Full Text: PDF