BP-MGKM: An efficient multi-group key management scheme based on bivariate polynomial

被引:3
|
作者
Sharma, Payal [1 ]
Purushothama, B. R. [1 ]
机构
[1] Natl Inst Technol Goa, Ponda 403401, Goa, India
关键词
Wireless sensor networks; Secure group communication; Key management scheme; Multi-group; Bivariate polynomial; DISTRIBUTION PROTOCOL; COMMUNICATION;
D O I
10.1016/j.comnet.2022.109244
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
As wireless sensor networks are becoming increasingly reliant on communication among heterogeneous wire -less sensor nodes, the need for secure communication in multi-groups has grown tremendously. Secure group key management in the multi-group scenario is a major challenge. The existing group key management schemes focus on managing a single group. However, there is not much work done regarding secure communication in multiple groups simultaneously. Existing multi-group key management schemes usually fail to meet the performance demands and suffer from improper management of keys, violation of security requirements, or huge complexity. We have analyzed the existing schemes for secure multi-group key management and found that the major issue lies in the complexity overhead during the membership update process in the multi-group scenario. On that account, we have proposed a new and efficient scheme (BP-MGKM) for secure multi-group key management based on bivariate polynomial. BP-MGKM is more efficient than other existing schemes in the context of complexity incurred during re-keying procedures. BP-MGKM features forward and backward secrecy, resilience against node compromise attack, collusion attack, and replay attack. The proposed scheme is secure and efficient than the existing schemes.
引用
收藏
页数:15
相关论文
共 50 条
  • [31] An efficient group key management scheme: Link tree protocol
    Zhang, J
    Ma, FY
    Gu, DW
    Bai, YC
    PDCAT 2005: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Proceedings, 2005, : 381 - 385
  • [32] A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
    Fulin Li
    Yang Liu
    Jiayun Yan
    Shixin Zhu
    Cryptography and Communications, 2022, 14 : 1039 - 1053
  • [33] A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
    Li, Fulin
    Liu, Yang
    Yan, Jiayun
    Zhu, Shixin
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (05): : 1039 - 1053
  • [34] Research on Relay Selection Scheme Based on Reduced Interference in Multi-Group Multicast
    Tang, Zhiqing
    Yang, Shouyi
    Zhang, Ruizhe
    Li, Guangping
    PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MODELLING, SIMULATION AND APPLIED MATHEMATICS (MSAM2017), 2017, 132 : 114 - 117
  • [35] A global progressive image secret sharing scheme under multi-group joint management
    Zhang, Lina
    Zhang, Jing
    Sun, Jiaqi
    Chen, Qingpeng
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2024, 21 (01) : 1286 - 1304
  • [36] A multi-group e-commerce signature scheme based on quantum teleportation
    Dai, Jinqiao
    Zhang, Shibin
    Xia, Jinyue
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2020, 22 (2-3) : 243 - 251
  • [37] Ternary polynomial based key management scheme for wireless sensor network
    Guan, Z.-T., 1600, Editorial Board of Journal on Communications (34):
  • [38] A novel key management scheme based on discrete logarithms and polynomial interpolations
    Shen, VRL
    Chen, TS
    COMPUTERS & SECURITY, 2002, 21 (02) : 164 - 171
  • [39] Hierarchical Polynomial-based Key Management Scheme in Fog Computing
    Albakri, Ashwag
    Maddumala, Mahesh
    Harn, Lein
    2018 17TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (IEEE TRUSTCOM) / 12TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING (IEEE BIGDATASE), 2018, : 1593 - 1597
  • [40] Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings
    Sudheeradh, K.
    Jahnavi, N. Neha
    Chine, Pramod N.
    Kasbekar, Gaurav S.
    IEEE ACCESS, 2024, 12 : 5659 - 5671