基于双线性对的部分盲签名中的“约分攻击”  

“Reduction Attacks” in Partially Blind Signature Based on Bilinear Pairings

作　　者：侯整风[1] 王鑫[1] 韩江洪[1] 朱晓玲[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《计算机科学》2013年第5期136-140,共5页Computer Science

基　　金：安徽省自然科学基金(090412051);广东省教育部产学研结合项目(2008B0905002400)资助

摘　　要：研究了3个基于双线性对的部分盲签名方案,发现其签名公式存在相似性。随后对3种相应的"约分攻击"方法进行了对比分析,指出上述3个方案存在篡改协商信息攻击的根本原因。由上述分析结果得出一类基于双线性对的部分盲签名方案存在"约分攻击"的推论,并进一步对上述推论进行了验证。We studied three partially blind signature schemes,and found out the similarity in signature formulas of the three schemes. Then we compared and analized the three corresponding methods of＂reduction attacks＂, and the basic reason why these schemes are vulnerable to tampering common information attacks was pointed out. From the above analysis results, we deduced the conclusion that a class of partially blind signature schemes based on bilinear pairings are vulnerable to ＂reduction attacks＂. Moreover, the deduction was verified.

关 键 词：双线性对 部分盲签名 篡改协商信息攻击 

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