TY - JOUR
T1 - An Efficient Identity-Based Proxy Blind Signature for Semioffline Services
AU - Zhu, Hongfei
AU - Tan, Yu An
AU - Zhu, Liehuang
AU - Zhang, Quanxin
AU - Li, Yuanzhang
N1 - Publisher Copyright:
© 2018 Hongfei Zhu et al.
PY - 2018
Y1 - 2018
N2 - Fog computing extends the cloud computing to the network edge and allows deploying a new type of semioffline services, which can provide real-time transactions between two entities, while the central cloud server is offline and network edge devices are online. For an e-payment system and e-voting with such feature, proxy blind signature is a cornerstone to protect users' privacy. However, the signature based on number theorem, such as hard mathematical problems on factoring problem, discrete logarithm problem, and bilinear pairings, cannot defeat quantum computers attack. Meanwhile, these schemes need to depend on complex public key infrastructure. Thus, we construct an identity-based proxy blind signature scheme based on number theorem research unit lattice, which can defeat quantum computers attack and does not need to depend on public key infrastructure. The security of the proposed scheme is dependent on Ring-Small Integer Solution problem over number theorem research unit lattice. The proposed scheme meets the properties of blind signature and proxy signature. Then we compare the proposed scheme with other existing proxy blind signature schemes; the result shows that the proposed scheme outperforms ZM scheme except in proxy signer's signature size and can be more secure than TA scheme and MMHP scheme.
AB - Fog computing extends the cloud computing to the network edge and allows deploying a new type of semioffline services, which can provide real-time transactions between two entities, while the central cloud server is offline and network edge devices are online. For an e-payment system and e-voting with such feature, proxy blind signature is a cornerstone to protect users' privacy. However, the signature based on number theorem, such as hard mathematical problems on factoring problem, discrete logarithm problem, and bilinear pairings, cannot defeat quantum computers attack. Meanwhile, these schemes need to depend on complex public key infrastructure. Thus, we construct an identity-based proxy blind signature scheme based on number theorem research unit lattice, which can defeat quantum computers attack and does not need to depend on public key infrastructure. The security of the proposed scheme is dependent on Ring-Small Integer Solution problem over number theorem research unit lattice. The proposed scheme meets the properties of blind signature and proxy signature. Then we compare the proposed scheme with other existing proxy blind signature schemes; the result shows that the proposed scheme outperforms ZM scheme except in proxy signer's signature size and can be more secure than TA scheme and MMHP scheme.
UR - http://www.scopus.com/inward/record.url?scp=85047523459&partnerID=8YFLogxK
U2 - 10.1155/2018/5401890
DO - 10.1155/2018/5401890
M3 - Article
AN - SCOPUS:85047523459
SN - 1530-8669
VL - 2018
JO - Wireless Communications and Mobile Computing
JF - Wireless Communications and Mobile Computing
M1 - 5401890
ER -