Efficient code-based fully dynamic group signature scheme
From MaRDI portal
Publication:6201340
DOI10.1016/J.TCS.2024.114407WikidataQ129192024 ScholiaQ129192024MaRDI QIDQ6201340
Chongben Tao, Jie Chen, Luping Wang, Huan Dai
Publication date: 20 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A code-based group signature scheme
- A lattice-based group signature scheme with verifier-local revocation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- New code-based privacy-preserving cryptographic constructions
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Foundations of Fully Dynamic Group Signatures
- Scalable Group Signatures with Revocation
- Group Signatures with Almost-for-Free Revocation
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A new paradigm for public key identification
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- A Practical Group Signature Scheme Based on Rank Metric
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- Progress in Cryptology – Mycrypt 2005
- Topics in Cryptology – CT-RSA 2005
- Topics in Cryptology – CT-RSA 2005
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Advances in Cryptology - ASIACRYPT 2003
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
This page was built for publication: Efficient code-based fully dynamic group signature scheme
