Full-Domain Subgroup Hiding and Constant-Size Group Signatures

We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by using a new NIZK proof technique, related to the BGN cryptosystem and the GOS proof system, but that allows us to hide integers from the full domain rather than individual bits.

• Type: Conference
• Year: 2007
• Where: PKC
• Authors: Xavier Boyen, Brent Waters
• Keywords: Cryptography, GOS Proof System, Group Signature Scheme, NIZK Proof Technique, PKC 2007