On New Zero-Knowledge Proofs for Fully Anonymous Lattice-Based Group Signature Scheme with Verifier-Local Revocation

Zhang, Yanhua; Liu, Ximeng; Yin, Yawei; Zhang, Qikun; Jia, Huiwen

doi:10.1007/978-3-030-61638-0_21

Cited by 7 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since then, a series of GS from lattice based on NIZKPoK have been proposed [6][7][8][9][10], and their storage cost has reached logarithmic size. Later, the constant-size GS are constructed by Ling et al [11] and Zhang et al [12]. The former is based on the "confined guessing" technique of Ducas et al signature scheme [13]; and the latter uses a compact and scalable identity-encoding technique.…”

Section: Group Signaturementioning

confidence: 99%

“…Firstly, we fix the security parameter λ and the maximum number of members N. Other parameters will be set as described in Section 4.2. Specifically, we set N = 2 12 , = 4, κ = 26, dimension d = 2 12 , Gaussian parameter σ = 6 dq ≈ 1.01 • 10 8 , modulus q and Q are 2 36 , 2 72 respectively. Then we get a root-hermite factor by definition from [33].…”

Section: Efficiency Analysismentioning

confidence: 99%

See 1 more Smart Citation

Policy-Based Group Signature Scheme from Lattice

Tang¹,

Li²,

Ye³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Although the existing group signature schemes from lattice have been optimized for efficiency, the signing abilities of each member in the group are relatively single. It may not be suitable for complex applications. Inspired by the pioneering work of Bellare and Fuchsbauer, we present a primitive called policy-based group signature. In policy-based group signatures, group members can on behalf of the group to sign documents that meet their own policies, and the generated signatures will not leak the identity and policies of the signer. Moreover, the group administrator is allowed to reveal the identity of signer when a controversy occurs. Through the analysis of application scenarios, we concluded that the policy-based group signature needs to meet two essential security properties: simulatability and traceability. And we construct a scheme of policy-based group signature from lattice through techniques such as commitment, zero-knowledge proof, rejection sampling. The security of our scheme is proved to be reduced to the module short integer solution (MSIS) and module learning with errors (MLWE) hard assumptions. Furthermore, we make a performance comparison between our scheme and three lattice-based group signature schemes. The result shows that our scheme has more advantages in storage overhead and the sizes of key and signature are decreased roughly by 83.13%, 46.01%, respectively, compared with other schemes.

show abstract

Section: Group Signaturementioning

confidence: 99%

Section: Efficiency Analysismentioning

confidence: 99%

Policy-Based Group Signature Scheme from Lattice

Tang¹,

Li²,

Ye³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Obviously, this article is a following work of [32] which is implied but not given clearly. And after [32], a series of rich contents of Zhang et al [33][34][35] has developed our protocol to design a GS-VLR over lattices supporting explicit traceability and two new protocols for GS-VLR over lattices with improved anonymity.…”

Section: Remarkmentioning

confidence: 99%

An Improved Group Signature Scheme with VLR over Lattices

Zhang

Liu

et al. 2021

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

For group signatures (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism is the most flexible choice. As a post-quantum secure cryptographic counterpart of classical schemes, the first dynamic GS-VLR scheme over lattices was put forward by Langlois et al. at PKC 2014; furthermore, a corrected version was shown at TCS 2018. However, both designs are within Bonsai trees and featuring bit-sizes of group public-key and member secret signing key proportional to log N where N is the group size; therefore, both schemes are not suitable for a large group. In this paper, we provide an improved dynamic GS-VLR over lattices, which is efficient by eliminating a O log N factor for both sizes. To realize the goal, we adopt a more efficient and compact identity-encoding technique. At the heart of our new construction is a new Stern-type statistical zero-knowledge argument of knowledge protocol which may be of some independent cryptographic interest.

show abstract

“…However, if the group is too large, the lattice based zero knowledge proof's security is low. In 2020, Zhang et al 28 separated the generation of revocation tokens from member keys based on an identity encoding technology, and proposed a new zero‐knowledge proof protocol, thereby ensuring complete anonymity. Wang et al 29 proposed a code‐based VLR group signature in 2021.…”

Section: Introductionmentioning

confidence: 99%

Identity authentication for edge devices based on zero‐trust architecture

Liu

Qiu³

et al. 2022

Concurrency and Computation

View full text Add to dashboard Cite

Summary Device identity authentication is the first line of defense for edge computing security mechanisms. Many authentication schemes are often accompanied by high communication and computational overhead. In addition, due to the continuous enhancement of network virtualization and dynamics, the security requirements for logical boundaries of many enterprise information systems “cloudification,” and the huge data security challenges faced by enterprise core assets, all make the original "one‐time authentication, all the way" trust model no longer reliable. Therefore, the paper proposes a local identity authentication and roaming identity authentication protocol based on a zero‐trust architecture. First, we propose a revocable group signature scheme, the expiration time is bound to the key of each edge terminal device. According to this solution, since the identity authentication token generated by the expired key is invalid, it does not need to be included in the revocation list, which improves the efficiency of revocation checking. Compared with the current identity authentication protocol, this article not only builds a model based on the zero trust architecture, effectively solves the shortcomings of the network security protection architecture, but also considers the unforgeability of the expiration time, and realizes effective revocation and more efficient identity authentication.

show abstract

On New Zero-Knowledge Proofs for Fully Anonymous Lattice-Based Group Signature Scheme with Verifier-Local Revocation

Cited by 7 publications

References 30 publications

Policy-Based Group Signature Scheme from Lattice

Policy-Based Group Signature Scheme from Lattice

An Improved Group Signature Scheme with VLR over Lattices

Identity authentication for edge devices based on zero‐trust architecture

Contact Info

Product

Resources

About