Abstract With the development of Internet, privacy has become a primary concern of users. Anonymous authentication plays an important role in privacy-preserving systems. A k-times anonymous authentication (k-TAA) scheme allows a group member to anonymously authenticate to the application provider up to k times. Considering quantum computing attacks, lattice-based k-TAA was introduced. However, existing schemes neither support the dynamic granting and revocation of users nor enable users to control the release of their attributes. In this paper, we construct the first lattice-based dynamic k-TAA, which offers limited times anonymous authentication, dynamic member management, attribute-based authentication, and post-quantum security. We present a concrete construction, and reduce its security to standard complexity assumptions. Notably, compared with existing related schemes based on lattices, our scheme is efficient in terms of communication cost.
Song et al. (Sat,) studied this question.