A (t, n) threshold signature scheme allows t or more group members to generate signatures on behalf of a group with n members, while any t−1 or less members cannot do the same th...
Group signature schemes with membership revocation have been intensively researched. However, signing and/or verification of some existing schemes have computational costs of O(R)...
In resent years, Popescu proposed several group signature schemes based on the Okamoto-Shiraishi assumption in [8–11], and claimed his schemes are secure. However, this paper dem...
We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new ...