Provably Secure Group Key Management Approach Based upon Hyper-Sphere

Shaohua Tang School of Computer Science and Engineering, South China University of Technology, Guangzhou, Guangdong, P.R.China Lingling Xu School of Computer Science and Engineering, South China University of Technology, Guangzhou, Guangdong, P.R.China Niu Liu School of Computer Science and Engineering, South China University of Technology, Guangzhou, Guangdong, P.R.China Xinyi Huang School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, Fujian, P.R. China Jintai Ding Department of Mathematical Sciences, University of Cincinnati, OH Zhiming Yang School of Computer Science and Engineering, South China University of Technology, Guangzhou, Guangdong, P.R.China

TBD mathscidoc:2207.43068

IEEE Transactions on Parallel and Distributed Systems, 25, (12), 3253-3263, 2014.12
Secure group communication systems have become increasingly important for many emerging network applications. An efficient and robust group key management approach is indispensable to a secure group communication system. Motivated by the theory of hyper-sphere, this paper presents a new group key management approach with a group controller (GC). In our new design, a hyper-sphere is constructed for a group and each member in the group corresponds to a point on the hyper-sphere, which is called the member's private point. The GC computes the central point of the hyper-sphere, intuitively, whose “distance” from each member's private point is identical. The central point is published such that each member can compute a common group key, using a function by taking each member's private point and the central point of the hyper-sphere as the input. This approach is provably secure under the pseudo-random function (PRF) assumption. Compared with other similar schemes, by both theoretical analysis and experiments, our scheme (1) has significantly reduced memory and computation load for each group member; (2) can efficiently deal with massive membership change with only two re-keying messages, i.e., the central point of the hyper-sphere and a random number; and (3) is efficient and very scalable for large-size groups.
No keywords uploaded!
[ Download ] [ 2022-07-14 14:32:27 uploaded by dingjt ] [ 30 downloads ] [ 0 comments ]
@inproceedings{shaohua2014provably,
  title={Provably Secure Group Key Management Approach Based upon Hyper-Sphere},
  author={Shaohua Tang, Lingling Xu, Niu Liu, Xinyi Huang, Jintai Ding, and Zhiming Yang},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220714143227214192645},
  booktitle={IEEE Transactions on Parallel and Distributed Systems},
  volume={25},
  number={12},
  pages={3253-3263},
  year={2014},
}
Shaohua Tang, Lingling Xu, Niu Liu, Xinyi Huang, Jintai Ding, and Zhiming Yang. Provably Secure Group Key Management Approach Based upon Hyper-Sphere. 2014. Vol. 25. In IEEE Transactions on Parallel and Distributed Systems. pp.3253-3263. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220714143227214192645.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved