• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

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

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

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

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Y. Zhang, Y. Hu, W. Gao and M. Jiang, "Simpler Efficient Group Signature Scheme with Verifier-Local Revocation from Lattices," KSII Transactions on Internet and Information Systems, vol. 10, no. 1, pp. 414-430, 2016. DOI: 10.3837/tiis.2016.01.024.

[ACM Style]
Yanhua Zhang, Yupu Hu, Wen Gao, and Mingming Jiang. 2016. Simpler Efficient Group Signature Scheme with Verifier-Local Revocation from Lattices. KSII Transactions on Internet and Information Systems, 10, 1, (2016), 414-430. DOI: 10.3837/tiis.2016.01.024.