基于中国剩余定理的群签名改进方案  

Improved Group Signature Scheme Based on Chinese Remainder Theorem

作　　者：黄丛林[1] 仲红[1] 汪益民[1,2] 

机构地区：[1]安徽大学计算机科学与技术学院,合肥230601 [2]安徽农业大学现代教育信息中心,合肥230636

出　　处：《计算机科学》2016年第3期174-178,共5页Computer Science

基　　金：国家自然科学基金项目(61173188);安徽省科技攻关项目(1401b042015);安徽省高校自然科学研究重点项目(KJ2013A017)资助

摘　　要：自陈泽文首次提出基于中国剩余定理的群签名后,已出现不少对其改进的方案,但仍未有方案在不使用第三方辅助签名或验证的情况下实现非关联性。针对这一问题,提出了一个基于中国剩余定理的群签名改进方案,通过结合子集覆盖框架中完备子树的方法来实现上述非关联性,以满足群成员安全、快速的加入和撤销,而无需改变其他成员私钥。该方案还实现了防权威陷害攻击。最后对其安全性和效率进行分析,并与现有方案进行对比,结果表明,所提方案具有一定的优势。The group signature scheme based on Chinese remainder theorem was first proposed by Chen Ze-wen.Since then,several improved schemes have been proposed,but no scheme achieves the non-relation without using the third party to sign or verify.In order to solve this problem,we proposed an improved group signature scheme based on Chinese remainder theorem,which combines with the notion of complete subtree method in the subset cover framework.In addition,our scheme can provide non-relation,joining or revoking safely and quickly for each member without changing other members＇ private key,and also resist against authority trap attacks.Finally,we analyzed the security and efficiency of our scheme,and comparison results suggest that our scheme has some advantages over the existing schemes.

关 键 词：群签名 中国剩余定理 非关联性 完备子树方法 权威陷害攻击 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]