Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
From MaRDI portal
Publication:2317863
DOI10.1016/j.tcs.2019.03.023zbMath1455.94213arXiv1801.08737OpenAlexW2963225523WikidataQ128174595 ScholiaQ128174595MaRDI QIDQ2317863
Huaxiong Wang, San Ling, Yanhong Xu, Khoa Nguyen
Publication date: 13 August 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08737
Related Items (9)
Skipping the \(q\) in group signatures ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Foundations of fully dynamic group signatures ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Survey of Lattice-Based Group Signature ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ New code-based cryptographic accumulator and fully dynamic group signature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Policy-based signature scheme from lattices
- Group signature with deniability: how to disavow a signature
- 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
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- 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 (and deniability) with ease
