通信学报 ›› 2016, Vol. 37 ›› Issue (6): 20-28.doi: 10.11959/j.issn.1000-436x.2016112

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

无证书强指定验证者多重签名

杜红珍1,温巧燕2   

  1. 1 宝鸡文理学院数学与信息科学学院,陕西 宝鸡 721013
    2 北京邮电大学网络与交换技术国家重点实验室,北京 100876
  • 出版日期:2016-06-25 发布日期:2017-08-04
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;陕西省教育厅专项科研基金资助项目;陕西省自然科学基础研究基金资助项目

Certificateless strong designated verifier multi-signature

Hong-zhen DU1,Qiao-yan WEN2   

  1. 1 School of Mathematics and Information Science,Baoji University of Arts and Sciences,Baoji 721013,China
    2 State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Online:2016-06-25 Published:2017-08-04
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Scientific Research Project of Shaanxi Provincial Educations Department;The Basic Research Project of Natural Science in Shaanxi Province

摘要:

为了满足在司法行政、电子政务等领域的应用需求,提出了无证书强指定验证者多重签名的概念和敌手模型,利用双线性对构造了第一个无证书强指定验证者多重签名方案,在计算双线性Diffie-Hellman问题和计算Diffie-Hellman问题假设下证明了该方案是存在性不可伪造的,而且该方案满足强指定验证者签名和多重签名应具备的性质。方案执行效率高,生成的指定验证者多重签名长度仅为160 bit,签名验证时需要的双线性对运算个数是固定的,仅需一个双线性对。所以,即使在计算资源与网络带宽受限的无线网络中方案也非常实用。

关键词: 无证书公钥密码学, 指定验证者多重签名, 不可伪造性, 双线性对

Abstract:

In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless strong designated verifier multi-signature scheme from bilinear pairings was constructed and it was proved that the scheme is existentially unforgeable under the computational bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption.Moreover,the scheme meets the properties of both strong designated verifier signatures and multi-signatures.The scheme achieves high efficiency since the length of designated verifier multi-signature generated by the scheme is only 160 bits and the computational cost of bilinear pairings necessary for verification algorithm is constant,i.e.,one bilinear pairing.So,it can be applied in wireless networks of the limited computing resources and network bandwidth.

Key words: certificateless public key cryptography, designated verifier multi-signature, unforgeability, bilinear pairing

No Suggested Reading articles found!