Lattice-based group signature scheme with verifier-local revocation

118Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Support of membership revocation is a desirable functionality for any group signature scheme. Among the known revocation approaches, verifier-local revocation (VLR) seems to be the most flexible one, because it only requires the verifiers to possess some up-to-date revocation information, but not the signers. All of the contemporary VLR group signatures operate in the bilinear map setting, and all of them will be insecure once quantum computers become a reality. In this work, we introduce the first lattice-based VLR group signature, and thus, the first such scheme that is believed to be quantum-resistant. In comparison with existing lattice-based group signatures, our scheme has several noticeable advantages: support of membership revocation, logarithmic-size signatures, and weaker security assumption. In the random oracle model, our scheme is proved to be secure based on the hardness of the problem in general lattices - an assumption that is as weak as those of state-of-the-art lattice-based standard signatures. Moreover, our construction works without relying on encryption schemes, which is an intriguing feature for group signatures. © 2014 Springer-Verlag Berlin Heidelberg.

References Powered by Scopus

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

5495Citations
N/AReaders
Get full text

How to prove yourself: Practical solutions to identification and signature problems

2555Citations
N/AReaders
Get full text

Trapdoors for hard lattices and new cryptographic constructions

1935Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Zero-knowledge arguments for lattice-based accumulators: Logarithmic-size ring signatures and group signatures without trapdoors

148Citations
N/AReaders
Get full text

Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions

99Citations
N/AReaders
Get full text

Group signatures from lattices: Simpler, tighter, shorter, ring-based

99Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Langlois, A., Ling, S., Nguyen, K., & Wang, H. (2014). Lattice-based group signature scheme with verifier-local revocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383 LNCS, pp. 345–361). Springer Verlag. https://doi.org/10.1007/978-3-642-54631-0_20

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 11

55%

Researcher 5

25%

Professor / Associate Prof. 2

10%

Lecturer / Post doc 2

10%

Readers' Discipline

Tooltip

Computer Science 18

90%

Physics and Astronomy 1

5%

Mathematics 1

5%

Save time finding and organizing research with Mendeley

Sign up for free