Efficient Certificate-Based Blind Signature Scheme without Bilinear Pairings

Abstract

Blind signature is a well-known cryptographical technique used to construct some advanced applications for the consideration of user privacy. In this work, we propose the first efficient certificate-based blind signature scheme that follows the idea of Certificate Based Encryption (CBE) presented by Gentry in EuroCrypt 2003. The security of our scheme is based on the elliptic curve discrete logarithm problem over a finite field. In addition, our scheme does not require any pairing operations which is regarded as cosely operations compared to other operations. Compared with the other secure blind signature scheme, our scheme enjoys shorter signature length, less running time and operation cost. So it can be used widely, especially in low-bandwidth communication environments such as wireless cooperative networks.

Secure Data Fusion Analysis on Certificateless Short Signature Scheme Based on Integrated Neural Networks and Elliptic Curve Cryptography

“…Huang [10] proposed an efficient certificate-free signature scheme, which did not need pairing operation to improve the operational efficiency of the scheme. Dong [11] proposed an improved certificate-free signature scheme, which used the secret value selected by the user as the signature private key to improve the security of the scheme.…”

Provable Secure Generic Construction of Proxy Signature from Certificate- based Signature

“…Then Au et al constructed a certificatebased (linkable) ring signature scheme [7] in the same year, and Liu et al [8] proposed two CBS schemes in 2008 one was a scheme without pairings, the other was proved for its security in the standard model. Unfortunately, Zhang [9] pointed out that Liu et al's scheme [8] [11], etc., including many extensions of the basic certificate-based signature schemes, like Chen and Huang's certificate-based proxy signature scheme [12], Huang et al's certificate-based blind signature scheme [13], and so on.…”