Sciweavers

Share
EUROCRYPT
2006
Springer

Compact Group Signatures Without Random Oracles

11 years 3 months ago
Compact Group Signatures Without Random Oracles
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.
Xavier Boyen, Brent Waters
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where EUROCRYPT
Authors Xavier Boyen, Brent Waters
Comments (0)
books