An Efficient Identity‐Based Proxy Blind Signature for Semioffline Services

Abstract

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.

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

“…The scheme exhibits message recovery and caters to the requirements of low-bandwidth because it abbreviates the size of message signature. The efficient identity-based proxy blind signature scheme proposed by Zhu et al can even overcome a quantum computer a ack [40]. A designated verifier signature scheme is proposed by Jakobsson et al [41].…”

Designated Verifier Proxy Blind Signature Scheme for Unmanned Aerial Vehicle Network Based on Mobile Edge Computing

“…It shortens the size of message signature and is suitable for the applications with low bandwidth. Zhu et al proposed an efficient identity-based proxy blind signature scheme [26]. It is based on number theorem research unit lattice and can defeat quantum computer attack.…”

Achieving Semantic Secure Search in Cloud Supported Information-Centric Internet of Things

“…Sun et al [14] subscribe a scheme over encrypted cloud data which can achieve effective user revocation in a multiple users and multiple contributor scenario. Sun et al [14] also put forward a fine-grained search scheme which conducts search authorization on the file level by utilizing CP-ABE technique [28]- [34]. Bao et al [35] formulate a system model to research searchable encryption in actual multi-user settings, and obtains results included a set of security concepts for multi-user searchable encryption, which can be proved security.…”

“…So the semi-trusted Cloud Server cannot successfully identify any information about indexes from the ciphertexts. The documents are encrypted by symmetric keys which are conserved by CP-ABE [28]. So the confidentiality of documents is based on symmetric encryption and CP-ABE.…”

“…Only if data users match his secret keys with access trees and recover the secret values successfully, the symmetric keys can be acquired. The security of CP-ABE is proved in [28]. In this way, the privacy of documents is guaranteed and CSP cannot recognize plaintexts from encrypted documents.…”