基于ID强可证安全的数字签名方案

针对现有签名方案或者不是强可证安全的,或者计算复杂度大、实用性差的问题,提出了一种基于ID(Identity)的超奇异椭圆曲线E(Zq*)上的强可证安全的数字签名(PSSDVS:Provably Secure Strong DesignatedVerifier Signature)方案,方案的签名验证密钥基于通信双方ID,其安全性基于双线性计算CBDH(Computa-tional Bilinear Diffie-Hellman)问题和椭圆曲线上离散对数问题。本方案是前向安全的,比以前的SDVS方案更有效,即同时满足不可伪造性、不可见性、不可否认性、签名者秘密的保密性和签名者的前向安全性。在SDVS方案基础上,没有增加交互次数和计算量,又提出了加时间戳签名加密(MDVS:Modified strong Desig-nated Verifier Signencryption)方案,并验证了MDVS方案的安全性。实验结果表明,本方案计算比较简单,签名前和验证前各需要一次双线性对运算,签名和验证时都只需要一次椭圆曲线上的多倍点运算,是强可证安全的实用的签名方案。

ID-Based Provable Secure and Strong Designated Verifier Digital Signature Scheme

A novel ID-based PSSDVS(Provably Secure Strong Designated Verifier Signature) scheme on the supersingular elliptic curve E(Z*q) is presented,which is based on the IDs of the communication participants and its security is based on the computationnal bilinear Diffie-Hellman problem and the discrete logarithm problem on elliptic curves.This schemes has unforgeability,invisibility,non-transferability,privacy of signer's identity,signer's forward security,so it is provable secure and more efficient than previously proposed SDVS schemes under RO(Random Oracle) model.A MDVS(Modified strong Designated Verifier Signencryption) scheme is also presented,in which the time tab is taken as a key parameter.Without additional interactive times and compute costs,our MDVS scheme is as secure as our SDVS scheme.Experimental result shows that the computations of the schemes are simpler,which need one operation of pairing computation off-line and one Elliptic CurveMultiplication on-line respectively in signning and verifying.