A BD Group Key Negotiation Protocol based on Clustering Technology

doi:10.23940/ijpe.20.06.p6.875882

Int J Performability Eng ›› 2020, Vol. 16 ›› Issue (6): 875-882.doi: 10.23940/ijpe.20.06.p6.875882

Previous Articles Next Articles

A BD Group Key Negotiation Protocol based on Clustering Technology

Zengyu Cai^a,b, Zuodong Wu^b,c, Jianwei Zhang^b,c,*, and Wenqian Wang^a,b

^a School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, 450002, China;
^b Henan Key Laboratory of Food Safety Data Intelligence, Zhengzhou, 450002, China;
^c Software College, Zhengzhou University of Light Industry, Zhengzhou, 450002, China

Submitted on ; Revised on ; Accepted on
Contact: * E-mail address: mailzjw@163.com
About author:Zengyu Cai is an associate professor at Zhengzhou University of Light Industry. His research interests include trusted computing, plan recognition, and information security.
Zuodong Wu is pursuing his master's degree at Zhengzhou University of Light Industry. His research interests include network security and cloud computing.
Jianwei Zhang is a professor at Zhengzhou University of Light Industry. His research interests include broadband information network and network security.
Wenqian Wang is pursuing her master's degree at Zhengzhou University of Light Industry. Her research interests include network security and artificial intelligence.
Supported by:
This work is supported by the National Natural Science Foundation of China (No. 61672471), Key Technologies R&D Program of Henan Province (No. 202102210176), Fourth Batch of Innovative Leading Talents of Zhihui Zhengzhou 1125 Talent Gathering Plan (ZhengZheng [2019] No. 21), and Liaoning Provincial Department of Education Project (No. LQN201912).

Abstract

Abstract: Nowadays, there are usually large network groups. If the traditional group key negotiation protocol is adopted, the time cost consumed is very high and unrealistic when the session key calculation requires the participation of members in each group. To solve this problem, we propose a BD group key negotiation protocol based on clustering technology, which solves the defects of parallel key negotiation by clustering. We also conduct a security analysis under the assumption of discrete logarithm problem on elliptic curve and the Diffie-Hellman problem, which theoretically proves its security. Finally, the theoretical analysis and experimental results show that compared with existing key negotiation schemes, this protocol has good robustness, scalability, and lower communication and computing overhead, which has certain guiding significance for the research on user privacy protection in mobile cloud computing networks.

Key words: clustering technology, discrete logarithm, Diffie-Hellman, robustness, scalability, privacy protection

Zengyu Cai, Zuodong Wu, Jianwei Zhang, and Wenqian Wang. A BD Group Key Negotiation Protocol based on Clustering Technology [J]. Int J Performability Eng, 2020, 16(6): 875-882.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

References

1. Y. P. Wu, A. Khisti, C. Xiao,W. Giuseppe, “A Survey of Physical Layer Security Techniques for 5g Wireless Networks and Challenges Ahead,” IEEE Journal on Selected Areas in Communications, Vol. 36, No. 4, pp. 679-695, January 2018
2. L. Jie, U. Twesh,L. Norbert, “Asymptotic Security Analysis of Discrete-Modulated Continuous-Variable Quantum Key Distribution,” Physical Review X, Vol. 9, No. 4, pp. 1-12, May 2019
3. B. Katharina and W. Leroy, “Why so Serious? Theorizing Playful Model-Driven Group Decision Support with Situated Affectivity,” Group Decision and Negotiation, Vol. 18, No. 1, pp. 1-22, February 2018
4. Z. Jian, G. Dawu,L. Yali, “An Efficient Fault-Tolerant Group Key Agreement Protocol,” Computer Communications, Vol. 33, No. 7, pp. 890-895, May 2010
5. T. Dutta, “A Secure Authenticated Group Key Agreement Protocol for Resource-Limited Mobile Devices,” The Computer Journal, Vol. 50, No. 1, pp. 1-12, January 2007
6. E. Bresson, C. Olivier,P. David, “Group Diffie-Hellman Key Exchange Secure Against Dictionary Attacks,” inProceedings of Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, pp. 23-30, Queenstown, New Zealand, December 2002
7. K. Xue, P. Hong,C. Ma, “A Lightweight Dynamic Pseudonym Identity based Authentication and Key Agreement Protocol Without Verification Tables for Multi-Server Architecture,” Journal of Computer and System Sciences, Vol. 80, No. 1, pp. 195-206, April 2012
8. F. L. Wang, F. Liu,Y. M. Zhao, “A Novel Approach of High Accuracy Analysis of Anisotropic Bilinear Finite Element for Time-Fractional Diffusion Equations with Variable Coefficient,” Computers Mathematics with Applications, Vol. 75, No. 10, pp. 3786-3800, March 2018
9. Y. Eun and Y. Kee-Young, “Robust Biometrics-based Multi-Server Authentication with Key Agreement Scheme for Smart Cards on Elliptic Curve Cryptosystem,” Journal of Supercomputing, Vol. 63, No. 1, pp. 235-255, January 2010
10. S. Kiing, “Vulnerabilities of Generalized MQV Key Agreement Protocol Without using One-Way Hash Functions,” Computer Standards and Interfaces, Vol. 29, No. 4, pp. 467-470, May 2007
11. H. Pan and S. Steven, “Bilinear Magneto-Electric Resistance as a Probe of Three-Dimensional Spin Texture in Topological Surface States,” Nature Physics, Vol. 14, No. 5, pp. 1-13, May 2018
12. X. Yao and Z. Chen, “A Lightweight Attribute-based Encryption Scheme for the Internet of Things,” Future Generation Computer Systems, Vol. 49, No. 1, pp. 104-112, October 2018
13. D. Bakkiam and D. Rajappa, “Analyzing Secure Key Authentication and Key Agreement Protocol for Promising Features of IP Multimedia Subsystem using IP Multimedia Server-Client Systems,” Multimedia Tools and Applications, Vol. 75, No. 4, pp. 2111-2143, December 2016
14. G. Hua and L. Zhoujun, “Provably Secure Identity-based Authenticated Key Agreement Protocols with Malicious Private Key Generators,” Information Sciences, Vol. 181, No. 3, pp. 628-647, February 2011
15. Z. Peng, B. Kaigui,Z. Tong, “Understanding Smartphone Sensor and App Data for Enhancing the Security of Secret Questions,” IEEE Transactions on Mobile Computing, Vol. 16, No. 2, pp. 1-13, January 2016

[1]	Amanpreet Kaur and Archana Mantri. Evaluating the Impact of Hybridization of Vision and Sensor-Based Tracking on the Accuracy and Robustness of Virtual Reality-Based Shooting Tutor for Defense Training [J]. Int J Performability Eng, 2023, 19(9): 559-567.
[2]	Ying Huang, Linglin Gong, Jianguo Zhang, Haiwei Fan, and Yizhuo Zhang. Review of Key Elements Identification and Robustness Analysis of Power Grid based on Complex Network Theory [J]. Int J Performability Eng, 2022, 18(5): 359-368.
[3]	Yuting Zheng, Dongcheng Li, Liyu Wang, Man Zhao, and Wen Ying. Robustness of the Planning Algorithm for Ocean Observation Tasks [J]. Int J Performability Eng, 2020, 16(4): 629-638.
[4]	Guoqiang Gong, Xin Cao, Ye Jin, Xiaobo Ding, and Ke Lv. K-Community Anonymity Approach for Social Network Data [J]. Int J Performability Eng, 2020, 16(10): 1665-1673.
[5]	Hui Xu, Jianpei Zhang, Jing Yang, and Lijun Lun. Node Importance Ranking of Complex Network based on Degree and Network Density [J]. Int J Performability Eng, 2019, 15(3): 850-860.
[6]	Hui Xu and Yang Li. Robustness Analysis of Urban Rail Transit Network [J]. Int J Performability Eng, 2019, 15(10): 2762-2771.

A BD Group Key Negotiation Protocol based on Clustering Technology

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 6

Recommended 0