Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing

Abstract

In the literature, several pairing-based blind signature schemes have been put forwarded using identity-based cryptography. However, the private key escrow problem of these schemes makes them unsuitable in practical environments because the private key generator computes signer private key using signer public identity. Therefore, an untrusted/semitrusted private key generator may perform malicious activity on behalf of the signer. We took the advantage of certificateless public key cryptography and constructed a robust and efficient certificateless blind signature (CL-BS) scheme using bilinear pairing. Furthermore, the probabilistic map-to-point hash function, which requires more computation time than the execution time of an elliptic curve scalar point multiplication, is circumvented in our scheme. We found that our scheme is unlinkable and provably secure against the adaptive chosen message and identity adversaries. From the perspective of computational costs, our scheme is more efficient and secure than other related schemes. Motivation and contributionIn the literature, several blind signature schemes are designed based on IBC. However, very less number of pairing-based certificateless blind signature (CL-BS) schemes [6][7][8] have been noticed. We observed that the schemes devised in [6][7][8][9][10][11][12][13] are based on the probabilistic map-to-point hash function [4], which needs more computation time than the time needed to execute an elliptic curve scalar point multiplication operation. In addition,

An Efficient and Provably Secure Certificateless Blind Signature Scheme for Flying Ad-Hoc Network Based on Multi-Access Edge Computing

“…The random oracle model is used to prove the effectiveness of the proposed scheme. It has been demonstrated on multiple occasions that the blind signature scheme offers forgery-proof operations when applied in sensitive applications such as e-voting and e-cash, among other applications [47,48]. However, anonymity and intractability of the voter and the unforgeability of the electronic vote are the main security concerns.…”

“…This section compares the performance of the proposed scheme with the existing counterparts suggested by Lei et al [4], Islam et al [47], Nayak et al [48], and Chen et al [49].…”

“…In Table 2, the proposed scheme is compared, in terms of computational cost, with the existing ones, that is, Lei et al's scheme [4], Islam et al's scheme [47], Nayak et al's scheme [48], and Chen et al's scheme [49], hereinafter also referred to as the "four chosen schemes", on the basis of major operations. We considered hyperelliptic divisor multiplication as elliptic curve scalar multiplication, and bilinear pairings are the most expensive operations used in the relevant existing schemes.…”

Short certificate‐based proxy signature scheme from pairings

“…To compute the computation cost, in Table 2, we denote a modular multiplication by M, map to point hash function by H, scalar multiplication by Sm, modular exponentiation by E, pairing operation by e and modular inversion by Inv. According to previous work, 45 the computation cost H ≈ 29M, Sm ≈ 29M, E ≈ 240M, e ≈ 87M and Inv ≈ 11.6M. To compute the costs in miliseconds (ms), we follow the work of Tsai, 46 where the cost of modular multiplication is M = 0.1 ms.…”

Heterogeneous signcryption with keyword search for wireless body area network

“…Certificateless public key cryptography 12 has gained popularity in designing lightweight cryptographic protocols. Islam et al 13,14 designed a key escrow free certificateless blind signature and a new anonymous certificateless multireceiver encryption. Researchers have also proposed PEKS/dPEKS based on certificateless public key cryptography.…”