Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease

DOI10.1007/978-3-030-31578-8_7zbMath1444.94124OpenAlexW2979496417MaRDI QIDQ3297617

Yan-Hua Zhang, Huiwen Jia, Qikun Zhang, Ximeng Liu, Yu Pu Hu

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_7

zbMATH Keywords

verifier-local revocationlattice-based group signaturesexplicit traceabilityidentity-encoding techniqueStern-type zero-knowledge proofs

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• A lattice-based group signature scheme with verifier-local revocation
• Constant-size group signatures from lattices
• Group signatures without NIZK: from lattices in the standard model
• Forward-secure group signatures from lattices
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• Foundations of Fully Dynamic Group Signatures
• A Lattice-Based Group Signature Scheme with Message-Dependent Opening
• Hardness of SIS and LWE with Small Parameters
• Lattice-Based Group Signatures with Logarithmic Signature Size
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Anonymous Attribute Tokens from Lattices
• Simpler Efficient Group Signatures from Lattices
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• A Group Signature Scheme from Lattice Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Group Signatures
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Lattice-Based Group Signature Scheme with Verifier-Local Revocation
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Topics in Cryptology – CT-RSA 2005
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease