An Efficient and Secure ID Based Group Signature Scheme from Bilinear Pairings

We propose an efficient and secure identity based group signature scheme from bilinear pairings. Group signature allows group member to sign arbitrary number of messages on behalf of the group without revealing their identity. Under certain circumstances the group manger holding a tracing key can reveal the identities of the signer from the signature. Our scheme is based on the Computation Diffie-Hellman Problem (CDHP) assumption and bilinear pairings. In the scheme, the size of the group public key and length of the signature are independent on the numbers of the group members.