Group-Oriented Range-Bound Key Agreement for Internet of Things Scenarios

• Published in: IEEE internet of things journal Vol. 5; no. 3; pp. 1890 - 1903
• Main Author: Chien, Hung-Yu
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.06.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: 3G mobile communication; 5G mobile communication; Agreements; Authentication; Electronic devices; Internet of Things; Internet of Things (IoT); key agreement; Long Term Evolution; Long Term Evolution (LTE); Mobile communication systems; Protocols; Security; Site planning; Universal Mobile Telecommunications System (UMTS)
• ISSN: 2327-4662; 2327-4662
• DOI: 10.1109/JIOT.2018.2817075

Authenticating the Internet-of-Things (IoT) devices in mobile systems is extremely challenging, because there will be billions of the IoT devices. Most existent proposals only focus on reducing the number of interactions to reduce the authentication overhead. However, there are several critical issues that need to be tackled. In this paper, we address the aggregated authentication overhead issue, the secure key agreement challenges, and the homogeneous trust and authorization issue in the mobile-system-based IoT scenarios. Based on the range-bound key assignment technique and our grouping mechanism, we propose the group-oriented-range-bound authenticated key agreement to solve these challenges. The main contributions are threefold. First, it drastically reduces the aggregated authentication overhead. Second, it greatly improves the security properties of the key agreement. Third, it facilitates the service providers the fine-grained control of the authentication delegation. To the best of our knowledge, the scheme demands the least authentication overhead among its counterparts; it is the first key agreement scheme that deals specifically with the homogeneous trust and authorization issue and facilitates the dynamic and adaptive authentication delegation. The security properties of the key agreement schemes are verified using a formal security verification tool, the AVISPA, and are analytically proved.