Threshold identification

In many applications, one needs to identify a user´s organization rather than his individual identity. A threshold identification scheme is a scheme in which the proof of the group identity can be identified if the members in the group who agree to prove their group identity anonymously is larger than t_g(⩽n, the total number of the members). In this paper, the authors propose a threshold identification scheme based on the El Gamal signature scheme and the Schnorr identification scheme. The proposed scheme is secure under the assumption that computing the discrete logarithm is infeasible. When the threshold value of a group is chosen as one, the threshold identification is a member authentication scheme