强不可伪造的在线/离线签名方案  

On-line/off-line signature scheme with strong unforgeability

作　　者：黄萍[1] 杨小东[1] 王彩芬[1] 

机构地区：[1]西北师范大学计算机科学与工程学院,兰州730070

出　　处：《计算机工程与应用》2016年第3期81-84,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61262057;No.61163038);甘肃省科技计划(No.145RJDA325);国家档案局科技项目计划(No.2014-X-33);甘肃省自然科学基金(No.1308RJYA039);兰州市科技计划项目(No.2013-4-22);西北师范大学青年教师科研能力提升计划基金资助项目(No.NWNU-LKQN-12-23)

摘　　要：针对标准模型下签名方案效率低的问题,利用目标抗碰撞杂凑函数和变色龙哈希函数,提出了一种在线/离线签名方案。在签名消息到来之前,离线阶段进行重签名的大部分计算,并将这些运算结果保存起来;在签名消息到来时,利用离线阶段保存的数据能在很短的时间内生成消息的在线重签名。在标准模型下,证明了新方案在适应性选择消息攻击下满足强不可伪造性。分析结果表明,新方案在效率上优于已有的标准模型下签名方案,在线签名算法仅需要1次模减法运算和1次模乘法运算,适合于计算能力较弱的低端计算设备。To resolve the problem of low efficiency of the existing signature schemes in the standard model, an on-line/ off-line signature scheme is proposed by using chameleon hash function and target collision-resistant hash function. Most of the computations are performed in the off-line phase before seeing the message to be signed. The results of this precomputation are saved and then used in the on-line phase when the message must be signed. Moreover, the proposed signature scheme is provably secure against strong forgery under adaptive chosen message attacks. Compared with the existing signature schemes in the standard model, the new scheme is more efficient in the computational cost. It needs one modular subtraction computation and one modular multiplication computation in the on-line re-signing generation algorithm. The proposed scheme is suitable for low-power devices when computing power is weak.

关 键 词：在线/离线签名 强不可伪造性 变色龙哈希函数 目标抗碰撞杂凑函数 

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