ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Fast and Lightweight Authenticated Group Key Agreement Realizing Privacy Protection for Resource-Constrained IoMT

Hsu, Chingfang; Harn, Lein; Xia, Zhe; Zhao, Zhuo*; Xu, Hangcent china normal univ
WIRELESS PERSONAL COMMUNICATIONS2023-4DOI: 10.1007/s11277-023-10239-0
5阅读
引用收藏
分享

摘要

Internet of Medical Things (IoMT) is mainly composed of patients, doctors and medical data collection equipment. In IoMT, the health data of patients is collected in real-time through mobile devices and stored in the network servers for access by legitimate medical personnel to facilitate monitoring, diagnosis and treatment services for patients. To securely transmit various types of data is the essential task of secure group communications for Internet of Things (IoMT). Collected data in IoMT have the particularity of being heterogeneous. At the same time, IoMT networks is exposed to some security threats caused by various attacks, as well as efficiency challenges caused by limited communication range and limited energy. Thus, how to securely group communicate and compute heterogeneous data between resource-constrained IoMT devices is a crucial problem to be solved. Due to the lightweight computational overhead required for group key agreement in resource-constrained environments, traditional protocols are not effectively applied by researchers in the IoMT. Based on symmetric binary polynomial and XOR operation, a lightweight and fast member authentication group key agreement is presented, which can be effectively applied in resource-constrained IoMT. The proposed scheme realizes the functions of membership authentication and group key negotiation, while improving the communication efficiency of group members. In terms of security, our scheme is resistant to both internal and external attacks and can satisfy all the defined security properties. Furthermore, using the logic XOR operation as the main operation method ensures that the computation cost in this protocol is lightweight. More importantly, in our proposal, the communication consumption at each group member end is not affected by the size of group, where the communication method between members is in a non-interactive and broadcast way. In consequence, our protocol provides a more efficient communication and computational process compared to recently proposed cryptographic schemes. Hence, this proposal is an excellent choice for solving membership authentication and group key agreement problems in resource-constrained IoMT systems.

学科与关键词

关键词
Resource-constrained IoMTSecure group communicationsMembership authenticated group key agreementPrivacy protectionLightweight and fast
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
WIRELESS PERSONAL COMMUNICATIONS
发表日期
2023-04
卷期
第 129 卷, 第 4 期
页码
2403-2417
DOI
10.1007/s11277-023-10239-0
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [U21A20465, 61922045, U1836115]; key projects of Guangxi Natural Science Foundation [62072133]; [2018GXNSFDA281040]; [61772224]; [62172181]

作者

  • H

    Hsu, Chingfang (第一作者)

    cent china normal univ

  • H

    Harn, Lein

    cent china normal univ

查看全部 5 位作者收起作者
  • X

    Xia, Zhe

    cent china normal univ

  • Z

    Zhao, Zhuo (通讯)

    cent china normal univ

  • X

    Xu, Hang

    cent china normal univ

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417