An efficient fully dynamic group signature with message dependent opening from lattice
Authors:
Open Access
- 3 May 2021
- journal article
- research article
- Published by Springer Nature in Cybersecurity
- Vol. 4 (1) , 1-15
Abstract
Message-dependent opening is one of the solutions to solve the problem of the tracing manager owns excessive power. In this paper, we present a new lattice-based fully dynamic group signature scheme with message-dependent opening by combining an improved version of the fully dynamic group signature scheme proposed by Ling et al and the double encryption paradigm. In addition, we propose an improved underlying zero knowledge protocol, it has a soundness error $\frac {1}{\max (n,p)+1}$ 1 max ( n , p ) + 1 that is better than the Stern-like protocol, which helps to bring down the communication complexity of the protocol and hence the signature scheme. Our scheme constrains the power of group managers by adding an admitter, and the signature size has a logarithmic relationship with the group size.Keywords
Funding Information
- The National Natural Science Foundation of China (No.61932019, No.61772521, No.61772522)
- The Key Research Program of Frontier Sciences, CAS (No.QYZDB-SSW-SYS035)
This publication has 31 references indexed in Scilit:
- Lattice-Based Group Signatures with Logarithmic Signature Size2013
- A Toolkit for Ring-LWE Cryptography2013
- A Group Signature Scheme from Lattice Assumptions2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Lattice-Based Identification Schemes Secure Under Active Attacks2008
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems2008
- Chosen-Ciphertext Security from Identity-Based Encryption2004
- Design Validations for Discrete Logarithm Based Signature Schemes2000
- A new paradigm for public key identificationIEEE Transactions on Information Theory, 1996
- Group Signatures1991