title: Provably-secure (Chinese government) SM2 and simplified SM2 key exchange protocols.
abstract: We revisit the SM2 protocol, which is widely used in Chinese commercial applications and by Chinese government agencies. Although it is by now standard practice for protocol designers to provide security proofs in widely accepted security models in order to assure protocol implementers of their security properties, the SM2 protocol does not have a proof of security. In this paper, we prove the security of the SM2 protocol in the widely accepted indistinguishability-based Bellare-Rogaway model under the elliptic curve discrete logarithm problem (ECDLP) assumption. We also present a simplified and more efficient version of the SM2 protocol with an accompanying security proof.
authors.affiliation: Information Assurance Research Group, Advanced Computing Research Centre, University of South Australia, Mawson Lakes, SA 5095, Australia.
authors.forename: Ang
authors.identifier: 0000-0002-5944-0882
authors.initials: A
authors.lastname: Yang
authors.affiliation: Department of Computer Engineering, Konkuk University, 268 Chungwondaero, Chungju, Chungcheongbuk-do 380-701, Republic of Korea.
authors.forename: Junghyun
authors.initials: J
authors.lastname: Nam
authors.affiliation: Information Management Division, Korean Intellectual Property Office, 189 Cheongsaro, Daejeon 302-701, Republic of Korea.
authors.forename: Moonseong
authors.initials: M
authors.lastname: Kim
authors.affiliation: Information Assurance Research Group, Advanced Computing Research Centre, University of South Australia, Mawson Lakes, SA 5095, Australia.
authors.forename: Kim-Kwang Raymond
authors.identifier: 0000-0001-9208-5336
authors.initials: KK
authors.lastname: Choo
mesh_terms: D000465:Algorithms; D002681:China; D003195:Computer Communication Networks / Q000592:standards*; D016494:Computer Security / Q000592:standards*; D003219:Confidentiality / Q000592:standards; D006076:Government; D008962:Models, Theoretical; D015203:Reproducibility of Results