Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
From MaRDI portal
Publication:6487207
DOI10.1007/978-3-319-61204-1_15zbMATH Open1522.9407MaRDI QIDQ6487207FDOQ6487207
Authors: San Ling, Khoa Nguyen, Huaxiong Wang, Yanhong Xu 
Publication date: 1 July 2022
Recommendations
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Group signature from lattices preserving forward security in dynamic setting
- A lattice-based fully dynamic group signature scheme without NIZK
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- A Group Signature Scheme from Lattice Assumptions
- Simpler efficient group signatures from lattices
- Forward-secure group signatures from lattices
- Achieving full security for lattice-based group signatures with verifier-local revocation
- Survey of lattice-based group signature
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Scalable group signatures with revocation
- Group signatures with almost-for-free revocation
- Group Signatures
- Title not available (Why is that?)
- Fully Anonymous Group Signatures Without Random Oracles
- Topics in Cryptology – CT-RSA 2005
- Lattice-based group signatures with logarithmic signature size
- Fully Anonymous Attribute Tokens from Lattices
- Simpler efficient group signatures from lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- A Group Signature Scheme from Lattice Assumptions
- Policy-based signature scheme from lattices
- A new paradigm for public key identification
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice-based group signature scheme with verifier-local revocation
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-bit Cryptosystems Based on Lattice Problems
- Dynamic fully anonymous short group signatures
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Group signatures with message-dependent opening
- Hardness of SIS and LWE with small parameters
- A lattice-based group signature scheme with message-dependent opening
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Title not available (Why is that?)
- Foundations of fully dynamic group signatures
- Short accountable ring signatures based on DDH
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Accumulating composites and improved group signing
Cited In (18)
- Group signature from lattices preserving forward security in dynamic setting
- Achieving full security for lattice-based group signatures with verifier-local revocation
- A generic construction of an anonymous reputation system and instantiations from lattices
- Memory lower bounds of reductions revisited
- A lattice-based group signature scheme with verifier-local revocation
- Constant-size group signatures from lattices
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Efficient code-based fully dynamic group signature scheme
- A lattice-based fully dynamic group signature scheme without NIZK
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- Secure Stern Signatures in Quantum Random Oracle Model
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- Universal vector commitments
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- A Group Signature Scheme from Lattice Assumptions
This page was built for publication: Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487207)
