中文摘要：

基于Square Computational Diffie-Hellman困难假设,构造了一个新型签名方案,在随机预言机模型下对其进行了安全性证明。基于该签名,设计出一个高效、盲化的可验证加密签名方案,方案满足不可伪造性、不透明性要求。与已有可验证加密签名方案相比,该方案计算代价小,一共仅需2次对运算和5次群上标量乘运算,且签名长度仅有320bit,所以非常适用于带宽受限的环境。

英文摘要：

In order to design a secure and efficient verifiably encrypted signature scheme,we first proposed a new digital signature scheme under the Square Computational Diffie-Hellman assumption.The scheme is probably secure in the random oracle model.And then,based on the proposed signature scheme,a blind verifiably encrypted signature（BVES） scheme was presented in this paper.The BVES scheme enjoys desirable properties of unforgeability and opacity.Compared with existing VES schemes,our scheme’s computational cost is lower and the whole operation only requires two pairing evaluations and five scalar multiplications.The size of the signature generated by our BVES is only 320 bits.So it can be used in environments with stringent bandwidth constraints.