欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
基于双线性对设计了一种有效的无证书签名方案，其安全性依赖于计算Diffie—Hellman（CDH）困难问题和离散对数困难问题的假设．在随机预言机模型下，证明了新方案能够抵抗适应性选择消息攻击下的存在性伪造．分析新方案的性能，并与其他方案进行了对比．结果表明，该方案的签名过程仅需要群上的3个乘运算和一个哈希运算，验证过程仅需3个双线性对运算和2个哈希运算，其运算效率明显提高．
英文摘要：
An efficient certificateless signature scheme based on bilinear pairing is proposed. The security of the scheme depends on the assumption of intractability such as the computational Diffie - Hellman （CDH） and discrete logarithm problem （DLP）. The existential unforgeability of this scheme is proved under adaptively chosen message attack against both types of adversaries in the random oracle model. The performance of the scheme is analyzed and compared with those of other schemes. The results show that the sign algorithm requires three scalar muhiplications and one hash operation. The verifying algorithm requires three pairing operations and two hash operations, so the scheme is more efficient than others.
同期刊论文项目
同项目期刊论文
期刊信息
位置：