Fully Anonymous Group Signatures Without Random Oracles

We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elements, and the scheme permits dynamic enrollment of new members. The scheme satisfies strong security requirements, in particular providing protection against key exposures and not relying on random oracles in the security proof.

• Type: Conference
• Year: 2007
• Where: ASIACRYPT
• Authors: Jens Groth
• Keywords: ASIACRYPT 2007, Bilinear Groups, Cryptology, Group Signature Scheme, Strong Security Requirements