A Group Authentication Scheme Based on Lagrange Interpolation Polynomial

Abstract

Group authentication, as a new type of security services in group communication application, can authenticate all users belonging to the same group at the same time. Most existing group authentication schemes are presented with high computation and communication complexities. Thus, in this paper, we propose a group authentication mechanism based on the Lagrange interpolation polynomial theory, which can distribute a number of secret shares to the group members and authenticate some/all of them at once later. From the experience analysis result, we show that both the computation and communication complexities of our proposed scheme are much lower than those of existing renowned group authentication scheme. And the security analysis result shows that the proposed scheme can guarantee the CIA (Confidentiality, Integrity and Availability) triad security model.