Cryptology ePrint Archive: Report 2005/381

Compact Group Signatures Without Random Oracles

Xavier Boyen and Brent Waters

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.

Category / Keywords: public-key cryptography / Group Signatures

Date: received 20 Oct 2005, last revised 7 Mar 2006

Contact author: bwaters at csl sri com

Available format(s): PDF | BibTeX Citation

Version: 20060307:234126 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]