A practical solution to the (t, n) threshold untraceable signature with (k, l) verification scheme

Abstract

The (t, n) threshold signature scheme can delegate the signing capability to all n participants in a group, and at least ; participants can cooperatively sign a message on behalf of the group, where t ≤ n . For the group communication in the real society, the verification site also needs to be restricted in its associated access privileges. Therefore, this paper proposes a practical solution to the (t, n) threshold untraceable signature with (k, l) verification scheme, which requires that k out of l verifiers or more can verify the threshold signature on behalf of the verification group. Compared with the previous works, such as Wang et al.'s scheme and Chang et al.'s scheme, our proposed scheme is more practical and expansible. Our scheme allows each group to be both a signing party and a verification party, and the shadows of all group members are no need to be redistributed after the initialization has been finished. In addition, the share distribution center (SDC) is not required in our scheme. © Springer-Verlag Berlin Heidelberg 2006.