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.

Highlights

  • Fog computing was initially introduced by Cisco, which can overcome cloud computing’s disadvantages, such as nonreal-time service and long delay [1,2,3]

  • We present an IDPBS-NTRU scheme by using NTRU lattice; this scheme plays an important role in offline e-payment system, which can be deployed in fog computing model

  • We demonstrate that IDPBS-NTRU is efficient and secure

Read more

Summary

Introduction

Fog computing was initially introduced by Cisco, which can overcome cloud computing’s disadvantages, such as nonreal-time service and long delay [1,2,3]. The e-payment and e-voting systems in the cloud still face the threat from quantum computer attack [17] These schemes need to rely on complex public key infrastructure (PKI) [18, 19]. If lattice-based PBS schemes can combine with identitybased cryptography (called IDPBS), they can overcome the shortcomings of traditional PBS schemes, such as relying on Wireless Communications and Mobile Computing complex PKI [22] They can transfer less data than biological recognition methods during the transactions [23, 24]. (1) Inspired by [25], a new IDPBS-NTRU scheme is proposed based on NTRU lattice, which can make semioffline e-payment and e-voting systems deployed in fog computing model secure enough to resist quantum computer attack.

Related Works
NTRU Lattice and Rejection Sampling on Lattice
Proposed IDPBS-NTRU Scheme
Security and Performance Comparison
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call