安全高效的无对运算无证书有序多重签名方案  

Secure and efficient certificateless sequential multi-signature scheme with no pair operation

作　　者：陈虹[1] 曹玥 金海波 王颖辉 Chen Hong;Cao Yue;Jin Haibo;Wang Yinghui(College of Software,Liaoning Technical University,Huludao Liaoning 125105,China)

机构地区：[1]辽宁工程技术大学软件学院,辽宁葫芦岛125105

出　　处：《计算机应用研究》2023年第11期3402-3407,共6页Application Research of Computers

基　　金：国家自然科学基金资助项目(62173171)。

摘　　要：针对目前多数有序多重签名方案存在安全性低或运算复杂的问题,提出了一种新的安全高效的无证书有序多重签名方案。为防止公钥替换攻击,将用户的身份标识与部分公钥进行哈希运算作为用户的部分私钥。签名用户需用指定的顺序验证签名阶段的部分签名,确保签名的有序性。在随机预言模型下,基于计算离散对数问题的困难性证明方案生成的签名是不可伪造、不可窜改。方案在签名和验证阶段主要涉及椭圆曲线点乘运算,不含双线性对操作,通过理论分析和仿真实验表明,与同类方案比较,所提方案最多提高了28%的效率。In order to address the problem of low security or complex computation in most existing sequential multi-signature schemes,this paper proposed a new secure and efficient certificateless sequential multi-signature scheme.To prevent public key replacement attacks,the scheme hashed the signer’s identity and part of public key as the partial private key of the sig-ner.Signers verified the partial signatures generated in the signature stage with the specified signature order to ensure the order of signatures.Under the random oracle model,the scheme was proved to be unforgeable and immutable based on the difficulty of computing discrete logarithmic problems.In the signature and verification stage,the scheme mainly involved elliptic curve point multiplication without bilinear pair.Theoretical analysis and simulation experiments show that compared with similar schemes,the proposed scheme can improve the efficiency by up to 28%.

关 键 词：有序多重签名 无证书签名 随机预言模型 无对运算 离散对数 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]