Paper 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.

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.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Full paper of Inscrypt'07
Keywords
Digital SignatureGroup SignatureUnlinkable Randomizable Signature
Contact author(s)
zhousujing @ is iscas ac cn
History
2007-11-21: last of 4 revisions
2007-06-06: received
See all versions
Short URL
https://ia.cr/2007/213
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/213,
      author = {Sujing Zhou and Dongdai Lin},
      title = {Unlinkable Randomizable  Signature and Its Application in Group Signature},
      howpublished = {Cryptology ePrint Archive, Paper 2007/213},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/213}},
      url = {https://eprint.iacr.org/2007/213}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.