Security of the SM2 signature scheme against generalized key substitution attacks

18Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Though existential unforgeability under adaptively chosenmessage attacks is well-accepted for the security of digital signature schemes, the security against key substitution attacks is also of interest, and has been considered for several practical digital signature schemes such as DSA and ECDSA. In this paper, we consider generalized key substitution attacks where the base element is considered as a part of the public key and can be substituted. We first show that the general framework of certificate-based signature schemes defined in ISO/IEC 14888-3 is vulnerable to a generalized key substitution attack. We then prove that the Chinese standard SM2 signature scheme is existentially unforgeable against adaptively chosen-message attacks in the generic group model if the underlying hash function h is uniform and collision-resistant and the underlying conversion function f is almost-invertible, and the SM2 digital signature scheme is secure against the generalized key substitution attacks if the underlying hash functions H and h are modeled as non-programmable random oracles (NPROs).

Cite

CITATION STYLE

APA

Zhang, Z., Yang, K., Zhang, J., & Chen, C. (2015). Security of the SM2 signature scheme against generalized key substitution attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9497, pp. 140–153). Springer Verlag. https://doi.org/10.1007/978-3-319-27152-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free