Chen, Huang, and Chung develop a multi-signature algorithm, based on an older paper by Popescu [1].

Using a one-way hashing function and Popescu’s identification scheme, the proposed algorithm meets the security and efficiency requirements of a cryptosystem. The hash function is designed with two characteristics: the output is of fixed length (the input depends of the number of group members), and applying this hash function can reduce the length of the signed message.

Section 2 presents the proposed scheme, with four phases: system initialization, key generation, multi-signature generation, and multi-signature verification.

Section 3 analyzes the algorithm’s efficiency and security (three types of attacks are considered). The authors further state that the scheme resists the chosen-message attack defined by ElGamal and Harn.

Section 4 presents the authors’ conclusions. A comparison of performances between this group signature scheme and the scheme proposed by Nyang (for application to smart cards) shows the advantage of the Chen-Huang-Chung scheme.