Simpler Efficient Group Signature Scheme with Verifier-Local Revocation from Lattices

• Yanhua Zhang,
• Yupu Hu,
• Wen Gao,
• Mingming Jiang,

Vol. 10, No. 1, January 30, 2016
10.3837/tiis.2016.01.024, Download Paper (Free):

• group signature
• verifier-local revocation
• lattice cryptography
• LWE
• SIS

Abstract

Verifier-local revocation (VLR) seems to be the most flexible revocation approaches for any group signature scheme, because it just only requires the verifiers to possess some up-to-date revocation information, but not the signers. Langlois et al. (PKC 2014) proposed the first VLR group signature based on lattice assumptions in the random oracle model. Their scheme has at 2 least O(n ) ⋅ log N bit group public key and O(n) ⋅ log N bit signature, respectively. Here, n is the security parameter and N is the maximum number of group members. In this paper, we present a simpler lattice-based VLR group signature, which is more efficient by a O(log N ) factor in both the group public key and the signature size. The security of our VLR group signature can be reduced to the hardness of learning with errors (LWE) and small integer solution (SIS) in the random oracle model.

Statistics

Cite this article