A new VRSA-based pairing-free certificateless signature scheme for fog computing
A new VRSA-based pairing-free certificateless signature scheme for fog computing
复制标题
一种新的基于VRSA的雾计算免配对无证书签名方案
DOI：
10.1002/cpe.4919
复制
发表时间：
2019
影响因子：
2
通讯作者：
Long Yu
中科院分区：
文献类型：
--
作者：
Wang Liangliang;Wen Mi;Chen Kefei;Bi Zhongqin;Long Yu
雾计算是由各种性能较弱的计算机代替性能较强的服务器组成的。正如历史所表明的那样，还没有一个通用的无配对无证书签名方案，主要是用模幂和模乘来设计的，可以抵抗I型和II型攻击者。需要研究一种轻量级的无证书签名算法，该算法对计算和存储能力要求低，可在雾计算中实现。因此，本文首先定义了一个新的数学难题，称之为RSA问题的变形。然后，基于RSA问题的变形和离散对数问题，提出了一个新的广义无配对无证书签名方案。幸运的是，该方案是第一个基于RSA的无证书签名方案，可以抵抗I型和II型攻击者。给出了一个形式化的安全性证明，证明了在随机预言机模型下，在适应性选择消息攻击下，该方案对I型和II型攻击者是可证明安全的.与其他已知的无配对无证书签名方案相比，该方案的计算量稍高，但安全性更高.
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.