Anonymous fingerprinting schemes are a cryptographic method for enforcing copyright protection. To date, because of certain obstacles that stand in the way of design, few desirable anonymous fingerprinting schemes based on group signature have been proposed, except for Camenisch's work in ASIACRYPT 2000. To overcome these obstacles, we present a concurrent-secure anonymous fingerprinting scheme by using the Kiayias-Yung group signature scheme as its main building block. In order to provide an efficient link between the given binary representation of the committed identifying information and the type of commitments needed in the underlying embedding protocol, we use an efficient signature of knowledge which is based on a proof of “OR” statement. Moreover, by incorporating the latest batch verifying technique for short signatures, the proposed scheme is particularly suitable for large buyer's group. In the random model, the new scheme is proved to fulfill all the required attributes of anonymous fingerprinting schemes.