Combining the concepts of attribute-based, undeniability and decentralization, a new concept of decentralized attribute-based undeniable signature with formal security model is proposed, and a concrete non-bilinear pair scheme based on discrete logarithm difficulty problem is constructed. The scheme uses the witness-hiding zero-knowledge proof protocol proposed by Cramer et al. And the Schnorr protocol as the basic Σ  protocol, and uses the Shamir threshold scheme as its secret sharing scheme. Then, Fiat-Shamir transformation is used to obtain a (t,n) threshold signature (BTS) scheme. Then, undeniability, anti-collusion, and decentralization are performed on the BTS scheme. Finally, a decentralized attributes-based undeniable signature scheme is obtained, and its security is proved under the random oracle model.