Cryptanalysis and Improvement of a Strongly Unforgeable Identity-Based Signature Scheme
Recently, Tsai et al. constructed an efficient identity-based signature (IBS) scheme and claimed that it was strongly unforgeable in the standard model. Unfortunately, we find that their scheme is insecure. By giving concrete attack, we show that their scheme does not meet the requirement of strong unforgeability. Meanwhile, we demonstrate that there are serious flaws in their security proof. The simulator cannot correctly answer the signing query in the security model. Furthermore, we propose an improved strongly unforgeable IBS scheme without random oracles. Compared with other strongly unforgeable IBS schemes in the standard model, our scheme is more efficient in terms of computation cost and signature size.
KeywordsIdentity-based signature Standard model Strong unforgeability Bilinear map
This work was partially supported by the National Natural Science Foundation of China (61662069, 61672020, 61472433, 61702309), China Postdoctoral Science Foundation (2017M610817, 2013M542560, 2015T81129), Natural Science Foundation of Gansu Province of China (145RJDA325, 1506RJZA130), Research Fund of Higher Education of Gansu Province (2014-A011), Science and Technology Project of Lanzhou City of China (2013-4-22), Foundation for Excellent Young Teachers by Northwest Normal University (NWNU-LKQN-14-7), Shandong Province Higher Educational Science and Technology Program (No. J16LN61).
- 5.Tseng, Y.M., Wu, T.Y., Wu, J.D.: An efficient and provably secure ID-based signature scheme with batch verifications. Int. J. Innovative Comput. Inf. Control 5(11), 3911–3922 (2009)Google Scholar
- 15.Hung, Y.H., Tsai, T.T., Tseng, Y.M., et al.: Strongly secure revocable ID-based Signature without random oracles. Inf. Technol. Control 43(3), 264–276 (2014)Google Scholar