A New Approach to Group Signature Schemes

This paper presents a new approach to group signature schemes. The advantage of this approach is that it provides a concurrent join and fast revocation to group members. Using this method, Based on the famous BLS signature scheme from bilinear pairings, we put forward a new group signature scheme. Due to the simple constructive method and the sound properties of bilinear pairings, it is shown that our scheme is very efficient. The proposed scheme is dynamic and has the advantages of short signature length. We analyze our scheme using the formal security notion of a dynamic group signature scheme and show that it satisfies the security properties of correctness, anonymity, traceability and Non-frameability.