Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
From MaRDI portal
Publication:6487207
DOI10.1007/978-3-319-61204-1_15zbMath1522.9407MaRDI QIDQ6487207
Khoa Nguyen, Huaxiong Wang, Yanhong Xu, San Ling
Publication date: 1 July 2022
Related Items (10)
Memory lower bounds of reductions revisited ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation ⋮ Secure Stern Signatures in Quantum Random Oracle Model ⋮ A lattice-based fully dynamic group signature scheme without NIZK ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Policy-based signature scheme from lattices
- 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
- Dynamic Fully Anonymous Short Group Signatures
- Scalable Group Signatures with Revocation
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Fully Anonymous Attribute Tokens from Lattices
- Group Signatures with Almost-for-Free Revocation
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Group Signatures with Message-Dependent Opening
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Short Accountable Ring Signatures Based on DDH
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Fully Anonymous Group Signatures Without Random Oracles
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- 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
- Multi-bit Cryptosystems Based on Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
