A Lattice-Based Fully Dynamic Group Signature Scheme Without NIZK

AbstractMessage-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.

Download Full-text

The Biometric Authentication based Dynamic Group Signature Scheme

Journal of the Korea Convergence Society ◽

10.15207/jkcs.2016.7.1.049 ◽

2016 ◽

Vol 7 (1) ◽

pp. 49-55 ◽

Cited By ~ 2

Author(s):

Sunghyun Yun

Keyword(s):

Group Signature ◽

Biometric Authentication ◽

Signature Scheme ◽

Dynamic Group

Download Full-text

An efficient full dynamic group signature scheme over ring

Cybersecurity ◽

10.1186/s42400-019-0037-8 ◽

2019 ◽

Vol 2 (1) ◽

Author(s):

Yiru Sun ◽

Yanyan Liu ◽

Bo Wu

Keyword(s):

Group Signature ◽

Signature Scheme ◽

Dynamic Group

Download Full-text

Fully Dynamic Group Signature Scheme with Member Registration and Verifier-Local Revocation

Mathematics and Computing - Springer Proceedings in Mathematics & Statistics ◽

10.1007/978-981-13-2095-8_31 ◽

2018 ◽

pp. 399-415 ◽

Cited By ~ 9

Author(s):

Maharage Nisansala Sevwandi Perera ◽

Takeshi Koshiba

Keyword(s):

Group Signature ◽

Signature Scheme ◽

Dynamic Group

Download Full-text

Efficient Dynamic Group Signature Scheme with Verifier Local Revocation and Time-Bound Keys using Lattices

International Journal of Computer and Information Technology(2279-0764) ◽

10.24203/ijcit.v10i2.93 ◽

2021 ◽

Vol 10 (2) ◽

Author(s):

Abhilash M H ◽

Amberker B B

Keyword(s):

Large Fraction ◽

Group Signature ◽

Signature Scheme ◽

Expiry Date ◽

Signature Schemes ◽

Significant Saving ◽

Dynamic Group ◽

Speed Up ◽

Verification Process ◽

Group Member

Revocation is an important feature of group signature schemes. Verifier Local Revocation (VLR) is a popular revocation mechanism which involves only verifiers in the revocation process. In VLR, a revocation list is maintained to store the information about revoked users. The verification cost of VLR based schemes islinearly proportional to the size of recvocation list. In many applications, the size of revocation list grows with time, which makes the verification process expensive. In this paper, we propose a lattice based dynamic group signature using VLR and time bound keys to reduce the size of revocation list to speed up the verification process. In the proposed scheme, an expiration date is fixed for signing key of each group member, and verifiers can find out (at constantcost) if a signature is generated using an expired key. Hence revocation information of members who are revoked before signing key expiry date (premature revocation) are kept in revocation list, and other members are part of natural revocation. This leads to a significant saving on the revocation check by assuming natural revocation accounts for large fraction of the total revocation. This scheme also takes care of non-forgeability of signing key expiry date.

Download Full-text