Premium
A new VRSA‐based pairing‐free certificateless signature scheme for fog computing
Author(s) -
Wang Liangliang,
Wen Mi,
Chen Kefei,
Bi Zhongqin,
Long Yu
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4919
Subject(s) - random oracle , schnorr signature , computer science , discrete logarithm , signature (topology) , modular exponentiation , merkle signature scheme , pairing , scheme (mathematics) , ring signature , elgamal signature scheme , theoretical computer science , modular design , cryptosystem , server , public key cryptography , digital signature , blind signature , mathematics , algorithm , cryptography , hash function , computer network , computer security , encryption , physics , mathematical analysis , geometry , superconductivity , quantum mechanics , operating system
Summary Fog computing is composed of various computers with weak performance instead of servers with strong performance. As history has shown, there has not been a general pairing‐free certificateless signature scheme that is mainly designed with modular exponentiation and modular multiplication that can possess resistance to Type I and Type II adversaries. The lightweight certificateless signature algorithm with low requirements for computing and storage capabilities, which can be practicably implemented in fog computing, needs to be studied. Therefore, a new hard mathematic problem is firstly defined in this paper, which is called variant of RSA problem. Then, a new general pairing‐free certificateless signature scheme is proposed based on the variant of RSA problem and the discrete logarithm problem. Fortunately, the proposed scheme is the first RSA‐based certificateless signature scheme that can possess resistance to Type I and Type II adversaries. A formal security proof is provided to demonstrate that, under adaptively chosen message attacks, the scheme is provably secure against Type I and Type II adversaries in the random oracle model. When compared with other known pairing‐free certificateless signature schemes of the same type, the computation cost of our scheme is slightly higher; however, a higher security level can be achieved.