Two-Level-Composite-Hashing Facilitating Highly Efficient Anonymous IoT and D2D Authentication

被引:7
作者
Chien, Hung-Yu [1 ]
机构
[1] Natl Chi Nan Univ, Dept Informat Management, Nantou 54561, Taiwan
关键词
Internet of Things; authentication; MQTT; hash; cloud; edge services; SECURITY; CODES;
D O I
10.3390/electronics10070789
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Resource limitation is quite popular in many Internet of Things (IoT) devices and eavesdropping on the identities of IoT devices could reveal the sensitive information; therefore, high efficiency (computation and communication) and anonymity protection are two desirable properties in IoT authentication and in device-to-device (D2D) authentication. Conventionally, dynamic pseudonyms are widely adopted to protect the device identity privacy in IoT authentication and in D2D communications; however, the conventional mechanisms of pseudonym-renewing and pseudonym-bound-public-keys updating could be very costly or be vulnerable to the desynchronization-based denial-of-service (DoS) attacks. In this paper, we propose a novel 2-level composite hashing (2LCH) mechanism to mitigate the problems, and propose the 2LCH-based anonymous IoT and D2D authentication schemes. The schemes simultaneously achieve high efficiency and strong anonymity for such environments; once two devices successfully complete one instance of the server-assist anonymous authentication, they can run several instances of the direct D2D anonymous authentication without the involvement of the server. The merits of the schemes include: (1) high efficiency in terms of computation and communication; (2) easy and efficient generation/synchronization of dynamic pseudonyms; (3) robustness to both desynchronization-based DoS attacks and the unreliable connections; (4) easy application to the existent IoT architectures and standards; and (5) formal security verification.
引用
收藏
页数:23
相关论文
共 43 条
  • [1] 3GPP, 2019, 3GPP Standard TS 23.501
  • [2] Alezabi KA, 2014, IEEE REGION 10 SYMP, P502, DOI 10.1109/TENCONSpring.2014.6863085
  • [3] Andrea I, 2015, 2015 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), P180, DOI 10.1109/ISCC.2015.7405513
  • [4] [Anonymous], OASIS MESSAGE QUEUIN
  • [5] [Anonymous], ISOIEC209222016
  • [6] [Anonymous], AVISPA A TOOL AUTOMA
  • [7] Basin D., 2005, Int. J. Inf. Secur., V4, P181, DOI [10.1007/s10207-004-0055-7, DOI 10.1007/S10207-004-0055-7]
  • [8] Bellare M, 1998, LECT NOTES COMPUT SC, V1462, P26, DOI 10.1007/BFb0055718
  • [9] Bellare M., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P1
  • [10] Burrows M., ACM T COMPUT SYST, P1