Abstract: Among the most of present anonymous authentication schemes, anonymous authentication process is complex, and the anonymous controllability is optional. To solve these two problems, a new threshold anonymous authentication scheme based on the intractability of the discrete logarithm is presented. With the help of the theory of solving linear equations, the member can get a share and the public key etc. Based on the idea of threshold secret sharing, the prover can be anonymous authenticated and anonymous tracked. The prover of the scheme is anonymous, threshold traceable, and inimitable, which can make the scheme well satisfy the security of anonymous authentication. The scheme will have broad application prospects in many fields such as electronic commerce, mobile communication.

Key words: anonymous authentication, secret sharing, linear equations, traceability, threshold

摘要： 现有的很多匿名认证方案中，匿名认证过程较为复杂，匿名的可控性比较随意，针对这两个问题，在求解离散对数困难性的基础上，提出了一个新的门限匿名认证方案。借助线性方程组的求解理论，获得成员的秘密份额和公钥身份等信息；基于门限共享的思想，实现示证者身份的匿名认证和匿名追踪。该方案中认证者的匿名性、门限可追踪性以及身份的不可冒充性满足了匿名认证的安全需求，在电子商务、移动通信等众多领域将具有广阔的应用前景。

关键词: 匿名认证, 秘密共享, 线性方程组, 追踪性, 门限性