Schnorr签名
随机预言
ElGamal签名方案
Merkle签名方案
数字签名
计算机科学
盲签名
方案(数学)
签名(拓扑)
戒指签名
离散对数
标准模型(数学公式)
认证(法律)
理论计算机科学
算法
公钥密码术
散列函数
数学
计算机安全
加密
数学分析
几何学
考古
量具(枪械)
历史
作者
Yuchen Xiao,Lei Zhang,Yafang Yang,Wei Wu,Jianting Ning,Xinyi Huang
标识
DOI:10.1016/j.csi.2023.103819
摘要
The multi-signature scheme plays a crucial role in addressing trust and authentication challenges in digital transactions and other scenarios by allowing multiple users to sign the same message. Among various signature schemes, the SM2 signature scheme stands out for its exceptional security and efficiency, making it widely adopted in numerous fields. In this paper, we propose the first provably secure multi-signature scheme based on the standard SM2 signature scheme, i.e., the scheme can be reduced to the standard SM2 signature scheme when there is only one signer. We prove that our scheme is existential unforgeability under chosen message attacks in the bijective random oracle model, based on the assumption that the elliptic curve discrete logarithm problem is hard. Compared with the existing multi-signature schemes based on the SM2 signature scheme in the same category, our scheme exhibits improved efficiency in terms of communication delay and computational cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI