Full-Domain Subgroup Hiding and Constant-Size Group Signatures

By Xavier Boyen and Brent Waters.

In Public Key Cryptography (PKC 2007), volume 4450 of Lecture Notes in Computer Science, pages 1-15. Springer, 2007.

**Awarded Best Paper**

Abstract

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.

Material

- published paper (PS) (PDF) (also accessible from the publisher) © IACR
- expanded version (PS) (PDF)
- presentation slides (HTML)

Reference

@InProceedings{Boyen+Waters:PKC-2007:groupsigs,
  author = {Xavier Boyen and Brent Waters},
  title = {Full-Domain Subgroup Hiding and Constant-Size Group Signatures},
  booktitle = {Public Key Cryptography---PKC 2007},
  series = {Lecture Notes in Computer Science},
  volume = {4450},
  pages = {1--15},
  publisher = {Berlin: Springer-Verlag},
  year = {2007},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/pkc07/}}
}