CryptoDB
Compact Group Signatures Without Random Oracles
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12715, title={Compact Group Signatures Without Random Oracles}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / Group Signatures}, url={http://eprint.iacr.org/2005/381}, note={ bwaters@csl.sri.com 13214 received 20 Oct 2005, last revised 7 Mar 2006}, author={Xavier Boyen and Brent Waters}, year=2005 }