Cryptology ePrint Archive: Report 2007/213

Unlinkable Randomizable Signature and Its Application in Group Signature

Sujing Zhou and Dongdai Lin

Abstract: We formalize a generic method of constructing efficient group signatures, specifically, we define new notions of unlinkable randomizable signature, indirectly signable signature and $\Sigma$-protocol friendly signature.

We conclude that designing efficient secure group signatures can be boiled down to designing ordinary signatures satisfying the above three properties, which is supported by observations that almost all currently known secure efficient group signatures have alternative constructions in this line without deteriorating the efficiency.

Category / Keywords: Digital Signature, Group Signature, Unlinkable Randomizable Signature

Publication Info: Full paper of Inscrypt'07

Date: received 5 Jun 2007, last revised 21 Nov 2007

Contact author: zhousujing at is iscas ac cn

Available format(s): PDF | BibTeX Citation

Note: This is the full version of the paper at Inscrypt 07, and appended with an important note Appendix D, where it was pointed out that Camenisch and Lysyanskaya's group signature scheme proposed at Crypto'04 is actually insecure.

Version: 20071121:072755 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]