通信学报 ›› 2013, Vol. 34 ›› Issue (2): 94-99.doi: 10.3969/j.issn.1000-436x.2013.02.011

• 学术论文 • 上一篇    下一篇

强安全无对的无证书签名方案

王亚飞1,张睿哲2   

  1. 1 平顶山学院 继续教育学院,河南 平顶山 467000
    2 平顶山学院 计算机科学与技术学院,河南 平顶山 467000
  • 出版日期:2013-02-25 发布日期:2017-07-17
  • 基金资助:
    河南省科技攻关基金资助项目

Strongly secure certificateless signature scheme without pairings

Ya-fei WANG1,Rui-zhe ZHANG2   

  1. 1 School of Continuing Education,Pingdingshan University,Pingdingshan 467000,China
    2 College of Computer Science and Technology,Pingdingshan University,Pingdingshan 467000,China
  • Online:2013-02-25 Published:2017-07-17
  • Supported by:
    The Science and Technology Projects of Henan Province

摘要:

摘 要:无证书的公钥密码学解决了基于PKI的公钥密码学的证书管理问题,以及基于身份的公钥密码学的密钥托管问题。最近,王等提出了一个不含双线性对运算的无证书签名方案。然而,通过对其进行分析,发现此方案是完全不安全的(即敌手可以获取用户的私钥),并给出了具体的攻击方法。为了改进其安全性,提出了一个新的更安全的无对的无证书签名方案,并在随机预言机模型下基于离散对数困难问题给出了安全性证明。此外,新方案效率非常高,签名算法只需要1个点乘运算,验证算法需要3个点乘运算。Abstract:Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity based cryptography.Recently,Wang et al.proposed a certificateless signature scheme without pairings.However,this scheme is completely insecure with a concrete attack method.A strongly secure pairing-free signature scheme is also proposed,which is provably secure in random oracle model under the assumption that the discrete logarithm problem is intractable.Furthermore,the efficiency of the proposed scheme is very high,since its signing algorithm only needs one scalar multiplication,and its verification algorithm needs three scalar multiplications.

关键词: 可证明安全, 双线性对, 无证书签名, 离散对数问题

Key words: probably security, bilinear pairings, certificateless signature, discrete logarithm problem

No Suggested Reading articles found!