摘要
针对先前的签名方案实现的效率不足,提出了格基在线/离线签名方案.该方案分为离线/在线两个阶段,离线阶段在未知消息的情况下进行大量的预计算,在获知消息的情况之后在在线阶段进行少量的计算.该方案仅在在线阶段对消息进行签名.最后,在小整数解假设下证明了新方案具有抗适应性选择消息攻击的强不可伪造性.与现有的方案相比,新方案实现效率高,安全性强,更能满足实际的需求.
Aiming at the efficiency weakness that exists in the signature schemes,a lattice-based online /offline signature scheme was proposed. The scheme splits the signature procedures into two phases: the offline phase / the online phase,the offline phase first performs most heavy precomputations before knowing message and the online phase performs light computations after receiving the message,the scheme only signs the message in the online phase. Finally,the scheme is proved to be strongly unforgeable against adaptive chosen-message attacks under small integer solution assumption. Compared with the known schemes,the new scheme can provide better efficiency in terms of communication overhead as well as the security guarantee,and thus it can more satisfy the actual application requirements.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2015年第3期117-120,134,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(61272455
61272457)
中央高校基本科研业务费专项基金项目(K50511010001
K5051201039)
高等学校博士学科点专项科研基金项目(20130203120003)
关键词
在线/离线签名
基于身份的密码体制
格
小整数解问题
online / offline signature
identity-based cryptography
lattice
small integer solution problem