检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《山东大学学报(理学版)》2015年第9期42-48,共7页Journal of Shandong University(Natural Science)
基 金:河南省高校青年骨干教师"资助计划"项目(2013GGJS-209);河南省科技攻关计划基金资助项目(142102210224);河南省高等学校重点科研项目(15A520091)
摘 要:大部分的聚合签名方案存在安全性缺陷和计算效率偏低的问题。通过对两种无证书聚合签名方案进行安全性分析,发现两种方案分别无法抵抗Type I和TypeⅡ的伪造性攻击。针对此类问题,提出了一个改进方案。该方案在签名过程中改变了参数的组合方式,在聚合签名验证中加强了对主密钥和公钥的约束。在计算性DiffieHellman困难问题假设下,证明了方案在适应性选择消息攻击下具有不可伪造性。效率分析表明,方案在签名与验证过程中只需要4个双线性对运算,签名的长度是固定的,与同类安全的无证书聚合签名方案相比,改进的方案效率更高。The security flaws and lowcomputational efficiency problem exist in most of the aggregate signature schemes. Based on the security analysis of two kinds of certificateless aggregate signature scheme,it is found that the two schemes can not resist forgery attack under Type I and Type II. Aiming at this sort of problems,we proposed an improved scheme that has changed the combination mode of parameters in the process of signature and has strengthened the constraints of master key and the public key in the process of aggregate signature verification. It was proved that the prosed scheme is existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model. The efficiency analysis shows that the scheme needs only 4 bilinear pairing operations in the signature process and the verification process,and the length of the signature is fixed. This improved scheme is more efficient comparing with the other certificateless aggregate signature schemes in similar secure level.
关 键 词:无证书密码体制 聚合签名 双线性对 随机预言模型
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28