Lattice-Based Dynamic $k$-times Anonymous Authentication

2025-09-25

AI Summary

Existing lattice-based k-times anonymous authentication (k-TAA) schemes lack dynamic authorization and revocation mechanisms and struggle to simultaneously achieve post-quantum security and communication efficiency. This paper proposes the first lattice-based k-TAA scheme supporting dynamic membership management, constructed under the standard Learning With Errors (LWE) assumption, enabling users to authenticate anonymously up to a prescribed number of times. Our approach innovatively integrates dynamic privilege control into the lattice cryptographic protocol, enabling fine-grained, real-time authorization and revocation. Moreover, the scheme significantly reduces communication overhead compared to prior lattice-based k-TAA constructions. Theoretical analysis and rigorous security proofs demonstrate that the scheme satisfies strong anonymity, unlinkability, and quantum resistance. As such, it is well-suited for privacy-critical distributed identity authentication systems requiring post-quantum security and flexible access control.

Technology Category

• Machine Learning: Privacy
• Search and Optimization: Distributed Search
• Data Mining & Knowledge Management: Representing, Reasoning, and Using Provenance, Trust

Application Category

• Security and Privacy: Large-scale security measurements
• Responsible Web: Data and user privacy-enhancing technologies for the Web
• User Modeling, Personalization and Recommendation: User privacy protection in personalized systems

Abstract

With the development of Internet, privacy has become a close concern of users. Anonymous authentication plays an important role in privacy-preserving systems. $k$-times anonymous authentication ($k$-TAA) scheme allows members of a group to be authenticated anonymously by application providers up to $k$ times. Considering quantum computing attacks, lattice-based $k$-TAA was introduced. However, existing schemes do not support dynamically granting and revoking users. In this paper, we construct the first lattice-based dynamic $k$-TAA, which offers limited times anonymous authentication, dynamic member management, and post-quantum security. We present a concrete construction, and reduce its security to standard complexity assumptions. Notably, compared with existing lattice-based $k$-TAA, our scheme is efficient in terms of communication cost.

Problem

• Enables limited anonymous authentications for group members
• Supports dynamic user granting and revocation management
• Provides post-quantum security using lattice-based cryptography

Innovation

• Lattice-based dynamic k-times anonymous authentication
• Supports dynamic member granting and revocation
• Efficient communication cost with post-quantum security