摘要
对已有多重签名方案进行了安全性分析,提出了可证安全的广播多重盲签名方案。给出了改进的广播多重盲签名算法和验证算法,并证明了改进方案满足盲性和不可伪造性。比较和分析了改进方案的复杂度和安全性,改进方案的运算量减少了37.2n+447.8TML。改进方案所需运算量少,安全性高且易于实现。
Multisignature algorithm by reference is analyzed. Provably secure broadcast blin d multisignature scheme is pre-sented. Specific signature and verification algorithms of Improved broadcast blind multisignature scheme are given. And the Im -proved scheme meets the properties of both blindness and non-forgery. The complexity and security of improved scheme are com-pared and analyzed. Improved scheme reduces computation costs 37.2n+447.8TML. Improved scheme has the advantages of low com-putation complexity, high security and easy to achieve.
出处
《计算机与数字工程》
2017年第7期1357-1359,共3页
Computer & Digital Engineering
基金
国家自然科学基金(编号:11302158
11626182)
陕西省科技厅项目(编号:2013JM1019
2014K05-43)
陕西省教育厅项目(编号:14JK1310)
西安航空学院基金项目(编号:2015KY1218
2016GJ1004)资助
关键词
超椭圆曲线
约化除子
盲签名
双线性对
hyperelliptic curve, reduced divisors, blind signature, bilinear pairings