Efficient code-based fully dynamic group signature scheme

Code-based group signature is an important research topic in recent years. Since the pioneering work by Alamélou et al.(WCC 2015), several other schemes have been proposed to provide improvements in security, efficiency and functionality. However, most existing constructions work only in the static...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 990; p. 114407
Main Authors: Wang, Luping, Chen, Jie, Dai, Huan, Tao, Chongben
Format: Journal Article
Language:English
Published: Elsevier B.V 01.04.2024
Subjects:
Code-based cryptography
Fully dynamic
Group signature
Post-quantum cryptography
Code-based cryptography
Post-quantum cryptography
Fully dynamic
Group signature
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Code-based group signature is an important research topic in recent years. Since the pioneering work by Alamélou et al.(WCC 2015), several other schemes have been proposed to provide improvements in security, efficiency and functionality. However, most existing constructions work only in the static setting where the group population is fixed at the setup phase. Only a few schemes address partially dynamic, which can realize only one of users enrollment or revocation. In this work, we provide an efficient code-based fully dynamic group signature (FDGS) scheme, i.e., users have flexibility when joining and leaving the group. Specifically, to upgrade the scheme into a fully dynamic group signature, we first add a dynamic ingredient into the static 2-RNSD Merkle-tree accumulator (ASIACRYPT 2019), then create a simple rule and utilize the Stern-like zero-knowledge protocol to handle users enrollment and revocation efficiently (i.e., without resetting the whole tree). Moreover, our solution is the first exploration of code-based FDGS with constant signature size.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2024.114407