MARAS: Mutual Authentication and Role-Based Authorization Scheme for Lightweight Internet of Things Applications

被引:5
作者
Seker, Oezlem [1 ,2 ]
Dalkilic, Goekhan [2 ]
cabuk, Umut Can [3 ]
机构
[1] Dokuz Eylul Univ, Grad Sch Nat & Appl Sci, TR-35390 Izmir, Turkiye
[2] Dokuz Eylul Univ, Dept Comp Engn, TR-35390 Izmir, Turkiye
[3] San Diego State Univ, Dept Elect & Comp Engn, San Diego, CA 92182 USA
关键词
authorization; HOTP; IoT; MQTT; mutual authentication; SECURITY; MQTT;
D O I
10.3390/s23125674
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
The Internet of things (IoT) accommodates lightweight sensor/actuator devices with limited resources; hence, more efficient methods for known challenges are sought after. Message queue telemetry transport (MQTT) is a publish/subscribe-based protocol that allows resource-efficient communication among clients, so-called brokers, and servers. However, it lacks viable security features beyond username/password checks, yet transport-layer security (TLS/HTTPS) is not efficient for constrained devices. MQTT also lacks mutual authentication among clients and brokers. To address the issue, we developed a mutual authentication and role-based authorization scheme for lightweight Internet of things applications (MARAS). It brings mutual authentication and authorization to the network via dynamic access tokens, hash-based message authentication code (HMAC)-based one-time passwords (HOTP), advanced encryption standard (AES), hash chains, and a trusted server running OAuth2.0 along with MQTT. MARAS merely modifies "publish" and "connect" messages among 14 message types of MQTT. Its overhead to "publish" messages is 49 bytes, and to "connect" messages is 127 bytes. Our proof-of-concept showed that the overall data traffic with MARAS remains lower than double the traffic without it, because "publish" messages are the most common. Nevertheless, tests showed that round-trip times for a "connect" message (and its "ack") are delayed less than a percentile of a millisecond; for a "publish" message, the delays depend on the size and frequency of published information, but we can safely say that the delay is upper bounded by 163% of the network defaults. So, the scheme's overhead to the network is tolerable. Our comparison with similar works shows that while our communication overhead is similar, MARAS offers better computational performance as it offloads computationally intensive operations to the broker side.
引用
收藏
页数:36
相关论文
共 57 条
  • [21] ietf.org, OAUTH 2 0 AUTH FRAM
  • [22] Katsikeas S, 2017, IEEE SYMP COMP COMMU, P1193, DOI 10.1109/ISCC.2017.8024687
  • [23] Kim HJ, 2011, LECT NOTES COMPUT SC, V6784, P622
  • [24] Iotverif: Automatic Verification of SSL/TLS Certificate for IoT Applications
    Liu, Anyi
    Alqazzaz, Ali
    Ming, Hua
    Dharmalingam, Balakrishnan
    [J]. IEEE ACCESS, 2021, 9 : 27038 - 27050
  • [25] Impacts of Sensing Energy and Data Availability on Throughput of Energy Harvesting Cognitive Radio Networks
    Liu, Xiaoying
    Xu, Bin
    Wang, Xiong
    Zheng, Kechen
    Chi, Kaikai
    Tian, Xianzhong
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (01) : 747 - 759
  • [26] Improved MQTT Secure Transmission Flags in Smart Homes
    Munshi, Asmaa
    [J]. SENSORS, 2022, 22 (06)
  • [27] Effective task scheduling algorithm with deep learning for Internet of Health Things (IoHT) in sustainable smart cities
    Nagarajan, Senthil Murugan
    Deverajan, Ganesh Gopal
    Chatterjee, Puspita
    Alnumay, Waleed
    Ghosh, Uttam
    [J]. SUSTAINABLE CITIES AND SOCIETY, 2021, 71
  • [28] Naik N, 2017, 2017 IEEE INTERNATIONAL SYMPOSIUM ON SYSTEMS ENGINEERING (ISSE 2017), P12
  • [29] Niruntasukrat A, 2016, IEEE INT CONF COMM, P290, DOI 10.1109/ICCW.2016.7503802
  • [30] One-time password based on hash chain without shared secret and re-registration
    Park, Chang-Seop
    [J]. COMPUTERS & SECURITY, 2018, 75 : 138 - 146