标准模型下基于身份的可证安全签名方案  

Provable Secure Identity Based Signature Scheme in the Standard Model

作　　者：张乐友[1] 胡予濮[2] 

机构地区：[1]西安电子科技大学应用数学系 [2]西安电子科技大学计算机网络与信息安全教育部重点实验室,西安市太白南路2号710071

出　　处：《武汉大学学报（信息科学版）》2008年第10期1076-1079,共4页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(60473029)

摘　　要：在标准模型下设计高效可证明安全的签名方案具有现实意义。基于Waters和Paterson最近提出的签名方案,提出了两种有效的标准模型下的基于身份的签名方案:一种为(t,n)门限方案,在计算Diffie-Hell-man假设(CDH问题)下,方案被证明具有不可伪造性和健壮性;另一种为分级签名方案,该方案签名算法效率高,仅需两次指数运算。在CDH困难问题假设下,该方案被证明是安全的。To design a signature scheme which are efficient and provably secure in the standard model is suitable for applications. Two signature schemes based on Paterson＇s and Waters＇s signature schemes are proposed. A（t, n） threshold signature scheme is presented at first and is provable secure in the standard model under CDH assumption. The other contribution in this paper is to construct a new hierarchical identity based signature scheme. It has a highly efficient signing algorithm which requires only two exponentiation operations and is provably secure under CDH assumption in the standard model.

关 键 词：(T N)门限签名方案 分级签名方案 标准模型 可证明安全 CDH问题 

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