Tree-Based Ring-LWE Group Key Exchanges with Logarithmic Complexity

Abstract

The rapid proliferation of Radio Frequency Identification (RFID) tags in the past decade has made tremendous impact on our daily lives. As part of Internet of Things (IoT), RFID technology ensures an efficient, secure and reliable system to identify tagged objects in supply chain environment such as manufacturing, automotive and healthcare. Several lightweight authentication solutions have been proposed to satisfy optimal security and privacy features of RFID communication. Hopper-Blum (HB) family of protocols that rely on the hard problem of Learning Parity with Noise (LPN) is a series of lightweight authentication protocol used to identify RFID tags. Our study shows that recent RFID authentication protocols from HB family that mostly focus on two party authentication such as tag-reader authentication, in general, cannot be applied directly to a three party authentication such as tag-reader-server authentication. In contrast to typical RFID authentication system, we consider the channel between the reader and back-end server insecure. We focus HB protocol and its variants and propose a modified protocol where the entire system is authenticated under LPN-based scheme.

Authenticated logarithmic-order supersingular isogeny group key exchange

“…The security of these protocols reduces to a Diffie-Hellman-like version of the decisional R-LWE problem, shown by Bos, Costello, Naehrig, and Stebila [9] to have comparable security to the decisional R-LWE problem. These GKEs were presented at ICICS 2020 [10] in a preliminary version. We extend these results by creating a compiler that turns both of our previous protocols into AGKEs, while maintaining logarithmic order complexities.…”