A Key Agreement Scheme for Smart Homes Using the Secret Mismatch Problem

被引:8
|
作者
Zhang, Yuexin [1 ,2 ]
Zhao, Hong [3 ]
Xiang, Yang [1 ,2 ]
Huang, Xinyi [3 ]
Chen, Xiaofeng [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[2] Swinburne Univ Technol, Sch Software & Elect Engn, Hawthorn, Vic 3122, Australia
[3] Fujian Normal Univ, Coll Math & Informat, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350117, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Key agreement; secret mismatch problem; security; smart homes; ESTABLISHMENT PROTOCOL;
D O I
10.1109/JIOT.2019.2936884
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To secure the communications of home area networks, cryptographic keys need to be established between smart home devices. Though many key agreement schemes have been proposed, they cannot be directly implemented, due to the reason that in some applications, smart home devices have no access to the online trusted third party. Moreover, in certain scenarios, the smart home devices are manufactured by different factories. As a result, it is a challenge to securely establish the communication keys using the secrets preloaded by different factories. A few key agreement schemes are designed without using the online trusted third party and the preloaded secrets. However, there are some problems in these schemes. In this article, we improve these schemes and design a key agreement scheme for smart homes such that the devices can automatically and securely establish the communication key. Specifically, our scheme is designed by making use of the secret mismatch problem (exists in the physical layer secret extraction schemes). We prove the security of the proposed scheme and present a prototype implementation. Additionally, we analyze the performance of our scheme and compare it with that of other related works. The comparison shows that our key agreement scheme can fix the problems in the related works, however, it introduces some extra communication consumptions.
引用
收藏
页码:10251 / 10260
页数:10
相关论文
共 50 条
  • [41] A Secure and Efficient Certificateless Authenticated Key Agreement Scheme for Smart Healthcare
    Ma, Yuqian
    Ma, Yongliu
    Liu, Yidan
    Cheng, Qingfeng
    CYBERSPACE SAFETY AND SECURITY, CSS 2022, 2022, 13547 : 17 - 31
  • [42] Provably Secure and Lightweight Authentication Key Agreement Scheme for Smart Meters
    Chai, Sheng
    Yin, Haotian
    Xing, Bin
    Li, Zhukun
    Guo, Yunyi
    Zhang, Di
    Zhang, Xin
    He, Da
    Zhang, Jie
    Yu, Xiaoling
    Wang, Wei
    Huang, Xin
    IEEE TRANSACTIONS ON SMART GRID, 2023, 14 (05) : 3816 - 3827
  • [43] Secure and Efficient Anonymous Authentication Key Agreement Scheme for Smart Industry
    Su, Xing
    Xie, Yong
    Wang, Hui
    Liu, Wei
    Shui, Dingyi
    2022 IEEE 28TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, ICPADS, 2022, : 250 - 257
  • [44] Some results on secret key agreement using correlated sources
    Muramatsu, Jun
    Yoshimura, Kazuyuki
    Arai, Kenichi
    Davis, Peter
    NTT Technical Review, 2008, 6 (02):
  • [45] Secret Key Agreement Using Asymmetry in Channel State Knowledge
    Khisti, Ashish
    Diggavi, Suhas
    Wornell, Gregory
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2286 - +
  • [46] A Lightweight Key Agreement Protocol Based on Chinese Remainder Theorem and ECDH for Smart Homes
    Jiang, Yi
    Shen, Yong
    Zhu, Qingyi
    SENSORS, 2020, 20 (05)
  • [47] Incremental and Decremental Secret Key Agreement
    Chan, Chung
    Al-Bashabsheh, Ali
    Zhou, Qiaoqiao
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2514 - 2518
  • [48] Linear Perfect Secret Key Agreement
    Chan, Chung
    2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
  • [49] From Chaos to Secret Key Agreement
    Ando, Megumi
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [50] Unique Information and Secret Key Agreement
    James, Ryan G.
    Emenheiser, Jeffrey
    Crutchfield, James P.
    ENTROPY, 2019, 21 (01):