Abstract | ||
---|---|---|
Attribute-based group signatures allow a group member who possesses certain attributes to anonymously sign messages on behalf the group, and an opening authority can reveal the real identity of the signer from a signature in case of any needed. Almost all of the existing schemes work only in the bilinear map setting and are insecure against quantum computers. The only exception is the lattice-based construction put forward by Kuchta et al. (ICISC 2017) that can handle the user enrollment, however, users cannot be revoked. As a flexible and practical revocation approach, verifier-local revocation (VLR) only needs the verifiers to own the up-to-date revocation information. In this work, we provide the first attribute-based VLR group signature from lattices, and thus, the first construction that supports for membership revocation and is quantum-resistant. The signature size of our scheme is linear in terms of the size of the threshold predicate and in the random oracle model, the security can be reduced to the worst-case lattice hardness problem, the approximating shortest independent vector problem (SIVP). |
Year | Venue | Field |
---|---|---|
2018 | ICA3PP | Bilinear map,Lattice (order),Computer science,Parallel computing,Random oracle,Quantum computer,Theoretical computer science,Revocation,Group signature,Lattice-based cryptography,Predicate (grammar) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
15 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yanhua Zhang | 1 | 145 | 24.84 |
Yong Gan | 2 | 13 | 4.91 |
Yifeng Yin | 3 | 1 | 0.69 |
Huiwen Jia | 4 | 6 | 4.51 |