Group signatures with reduced bandwidth

Group signatures with reduced bandwidth

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Group signatures are generalised credential/member authentication schemes with wide applications. Membership revocation problem is a major issue of group signatures, and is often resolved through an additional protocol which would encumber the whole group signature both in computation and storage, as Camenisch et al. did to ACJT's group signature scheme (the first ever practical group signature based on RSA problem put forward by Ateniese et al. at Crypto'00) by dynamic accumulator. Boneh et al. applied Camenisch et al.'s dynamic accumulator based revocation reversely, resulted in short group signature. We formally define the method used by Boneh et al., named reversed dynamic accumulator in this paper, and apply it on some previous group signatures to obtain improved ones with revocation capability, reduced bandwidth (signature size) and less signature generation computations. We also address the problems unsolved in Boneh et al.'s work, e.g. how to open a group signature since the current certificate may no longer be the one stored when it is firstly generated.


    1. 1)
      • Chaun , E. van Heyst . (1991) Group signatures, EUROCRYPT'91.
    2. 2)
      • G. Ateniese , J. Camenisch , M. Joye , G. Tsudik . (2000) A practical and provably secure coalition-resistant group signature scheme, CRYPTO'00.
    3. 3)
      • M. Bellare , H. Shi , C. Zhang . (2005) Foundations of group signatures: The case of dynamic groups, CT-RSA'05.
    4. 4)
      • Kiayias, A., Yung, M.: `Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders', 2004/076, Cryptology ePrint Archive, Report, 2004.
    5. 5)
      • G. Ateniese , G. Tsudik . (1999) Some open issues and new directions in group signature schemes, Financial Cryptography'99.
    6. 6)
      • E. Bresson , J. Stern . (2001) Efficient revocation in group signatures, PRC'01.
    7. 7)
      • G. Ateniese , D. Song , G. Tsudik . (2002) Quasi-efficient revocation in group signatures, Financial Cryptography'02.
    8. 8)
      • J. Camenisch , A. Lysyanskaya . (2002) Dynamic accumulators and application to efficient revocation of anonymous credentials, CRYPTO'02.
    9. 9)
      • L. Nguyen . (2005) Accumulators from bilinear pairings and applications, CT-RSA'05.
    10. 10)
      • L. Nguyen , R. Safavi-Naini . (2004) Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings, ASIACRYPT'04.
    11. 11)
      • D. Boneh , X. Boyen , H. Shacham . (2004) Short group signatures, CRYPTO'04.
    12. 12)
      • D. Boneh , X. Boyen . (2004) Short signatures without random oracles, EUROCRYPT'04.
    13. 13)
      • Z. Chen , J. Wang , Y. Wang , J. Huang , D. Huang . (2003) An efficient revocation algorithm in group signatures, ICISC'03.

Related content

This is a required field
Please enter a valid email address