Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Almost Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation

Version 1 : Received: 30 July 2018 / Approved: 1 August 2018 / Online: 1 August 2018 (10:00:31 CEST)

How to cite: Perera, M.N.S.; Koshiba, T. Almost Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation. Preprints 2018, 2018080014. https://doi.org/10.20944/preprints201808.0014.v1 Perera, M.N.S.; Koshiba, T. Almost Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation. Preprints 2018, 2018080014. https://doi.org/10.20944/preprints201808.0014.v1

Abstract

Efficient member revocation and strong security against attacks are prominent requirements in group signature schemes. Among the revocation approaches Verifier-local revocation is the most flexible and efficient method since it requires to inform only the verifiers regarding the revoked members. The verifier-local revocation technique uses a token system to manage members’ status. However, the existing group signature schemes with verifier-local revocability rely on weaker security. On the other hand, existing static group signature schemes rely on a stronger security notion called, full-anonymity. Achieving the full-anonymity for group signature schemes with verifier-local revocation is a quite challenging task. This paper aims to obtain stronger security for the lattice-based group signature schemes with verifier-local revocability, which is closer to the full-anonymity. Moreover, this paper delivers a new key-generation method which outputs revocation tokens without deriving from the users’ signing keys. By applying the tracing algorithm given in group signature schemes for static groups, this paper also outputs an efficient tracing mechanism. Thus, we deliver a new group signature scheme with verifier-local revocation that satisfies a stronger security from lattices.

Keywords

lattice-based group signatures; verifier-local revocation; anonymity; almost-full anonymity; traceability

Subject

Computer Science and Mathematics, Computer Networks and Communications

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.