Abstract

Authentication has been adopted in many areas, but most of these authentication schemes are built using traditional cryptographic primitives. It is widely believed that such primitives are not resistant to quantum algorithms. To deal with those quantum attacks, lattice-based cryptography was introduced by Ajtai in 1996. To the best of our knowledge, the existing lattice-based authentication schemes are based on a lattice-based public key encryption called NTRU: a ring-based public key cryptosystem, proposed by Hoffstein, Pipher, and Silverman in 1998. However, these schemes only support the case of a single user. In view of the aforementioned issue, we propose the first lattice-based group authentication scheme. The proposed scheme is secure against replay attacks and man-in-the-middle attacks. Moreover, compared with the existing lattice-based authentication schemes, ours provides the most efficient method to agree upon a session key among a group of users after mutual authentication.

Highlights

  • Nowadays, authentication has been adopted in many areas, such as radio frequency identification (RFID), cloud computing, wireless sensor networks, internet of things (IoT), etc.Authentication schemes can be separated into two types: one is individual-oriented authentication, and another is group-oriented authentication

  • To the best of our knowledge, the existing lattice-based authentication schemes [3,4] are based on a lattice-based public key encryption called NTRU encryption [5], proposed by Hoffstein, Pipher, and Silverman in 1998

  • Most authentication schemes are built on traditional cryptographic primitives

Read more

Summary

Introduction

Authentication has been adopted in many areas, such as radio frequency identification (RFID), cloud computing, wireless sensor networks, internet of things (IoT), etc. Such a cryptographic primitive can be applied heavily to many-to-many network environments, e.g., Internet of Things or RFID Most of these authentication schemes are built on traditional cryptographic primitives, e.g., RSA and ElGamal, where the cryptosystems are constructed based on discrete logarithm or factorization. To the best of our knowledge, the existing lattice-based authentication schemes [3,4] are based on a lattice-based public key encryption called NTRU encryption [5], proposed by Hoffstein, Pipher, and Silverman in 1998. These two schemes support only the case of a single user. Compared with the existing lattice-based authentication schemes, our scheme provides the most efficient authentication protocol in terms of the total cost to generate a session key among a group of users after mutual authentication

Notation
Lattices
The Gaussian Sampling Algorithm
The Proposed Scheme
Group Joining n o
Authentication
Security Analysis
Performance Comparisons
Conclusions
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.