Compact Group Signatures Without Random Oracles

By Xavier Boyen and Brent Waters.

In Advances in Cryptology (EUROCRYPT 2006), volume 4004 of Lecture Notes in Computer Science, pages 427-444. Springer, 2006.

Abstract

We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures in bilinear groups with a novel adaptation of the recent Non-Interactive Zero Knowledge proofs of Groth, Ostrovsky, and Sahai. The size of signatures in our scheme is logarithmic in the number of signers; we prove it secure under the Computational Diffie-Hellman and the Subgroup Decision assumptions in the model of Bellare, Micciancio, and Warinshi, as relaxed by Boneh, Boyen, and Shacham.

Material

- published paper (PS) (PDF) (also accessible from the publisher) © IACR
- full version (PS) (PDF) (also accessible on the cryptology eprint archive)

Reference

@InProceedings{Boyen+Waters:EUROCRYPT-2006:groupsigs,
  author = {Xavier Boyen and Brent Waters},
  title = {Compact Group Signatures Without Random Oracles},
  booktitle = {Advances in Cryptology---EUROCRYPT 2006},
  series = {Lecture Notes in Computer Science},
  volume = {4004},
  pages = {427--444},
  publisher = {Berlin: Springer-Verlag},
  year = {2006},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/eurocrypt06/}}
}