Efficient code-based fully dynamic group signature scheme

DOI10.1016/J.TCS.2024.114407MaRDI QIDQ6201340zbMATH OpenWikidataFDO

Authors Luping Wang, Jie Chen, Huan Dai, Chongben Tao

Publication date 20 February 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114407

zbMATH Keywords

code-based cryptographyfully dynamicgroup signaturepost-quantum cryptography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A code-based group signature scheme
• A lattice-based group signature scheme with verifier-local revocation
• A new paradigm for public key identification
• A practical and provably secure coalition-resistant group signature scheme
• A practical group signature scheme based on rank metric
• A provably secure group signature scheme from code-based assumptions
• Accumulating composites and improved group signing
• Accumulators from bilinear pairings and applications
• Design validations for discrete logarithm based signature schemes
• Dynamic accumulators and application to efficient revocation of anonymous credentials
• Efficient revocation in group signatures
• Foundations of fully dynamic group signatures
• Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
• Foundations of group signatures: the case of dynamic groups
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Group signatures
• Group signatures with almost-for-free revocation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• New code-based privacy-preserving cryptographic constructions
• On the Key-Privacy Issue of McEliece Public-Key Encryption
• Progress in Cryptology – Mycrypt 2005
• Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
• Scalable group signatures with revocation
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

Cited in

(2)

• Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
• Fully dynamic group signatures from subset difference methods under simple assumptions

This page was built for publication: Efficient code-based fully dynamic group signature scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201340)