In the era of the Internet of Everything, the Internet of Things (IoT) has become an integral part of people’s lives. Identity authentication faces significant challenges when dealing with various devices. Traditional one-to-one authentication methods struggle to meet the requirements of massive connected devices and do not account for the resource limitations of these devices. Group authentication (GA) in many-to-many authentication methods can effectively address the issues of large-scale authentication. Since Harn [1] proposed the group authentication scheme (GAS), extensive research has been conducted on GA. In GAS, the authentication of different users is conducted simultaneously rather than individually. Harn’s GAS [1] is based on Shamir’s threshold scheme, which has low computational resource requirements. Therefore, GA can be applied to resource-constrained IoT devices. While ensuring computational efficiency, security remains a significant challenge for current GA methods. However, many existing schemes cannot provide security guarantees for widespread use. In this paper, an asynchronous group authentication protocol based on bivari-ate symmetric polynomials and discrete logarithm problem are proposed. The method uses bivariate symmetric polynomials to generate tokens for group members. These tokens enable users to generate random values, which are then used to update the original tokens. This ensures that each user can protect the product of the Lagrange component and a generator of a cyclic group. The proposed scheme in this paper offer enhanced security.