Paper 2006/286
Shorter Verifier-Local Revocation Group Signatures From Bilinear Maps
Sujing Zhou and Dongdai Lin
Abstract
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous ones.
Note: Additionally a new scheme 4, a group signature without random oracles, is added. And schemes with O(1) complexity OPEN algorithms. The proof of Scheme 3 provided previously in Appendix E is flawed, we provide more efficient VLR schemes with backward unlinkability and non-frameability with proof in Appendix F. Welcome for any comments.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. This is the full version of the paper in CANS 06.
- Keywords
- LRSW AssumptionGroup SignatureVerifier-Local RevocationBilinear Map.
- Contact author(s)
- zhousujing @ is iscas ac cn
- History
- 2006-12-01: last of 2 revisions
- 2006-08-22: received
- See all versions
- Short URL
- https://ia.cr/2006/286
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/286,
author = {Sujing Zhou and Dongdai Lin},
title = {Shorter Verifier-Local Revocation Group Signatures From Bilinear Maps},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/286},
year = {2006},
url = {https://eprint.iacr.org/2006/286}
}
