Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation

11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suitable revocation approach for any group since when a member is revoked VLR requires to update only verifiers. However, presenting a fully dynamic and fully secured lattice-based group signature scheme with verifier-local revocation is a significant challenge. Thus, we suggest a new security notion to prove the security of VLR schemes with member registration. As a result, we present a dynamical-almost-fully secured fully dynamic group signature scheme from lattices with VLR.

Cite

CITATION STYLE

APA

Perera, M. N. S., & Koshiba, T. (2018). Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11125 LNCS, pp. 229–247). Springer Verlag. https://doi.org/10.1007/978-3-319-99807-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free