Recommendations
Cites work
- A Group Signature Scheme from Lattice Assumptions
- A lattice-based group signature scheme with message-dependent opening
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Bonsai trees, or how to delegate a lattice basis
- Compact Group Signatures Without Random Oracles
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Constant-size group signatures from lattices
- Dynamic fully anonymous short group signatures
- Efficient lattice (H)IBE in the standard model
- Foundations of fully dynamic group signatures
- Fully Anonymous Attribute Tokens from Lattices
- Fully Anonymous Group Signatures Without Random Oracles
- Group Signatures
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Group Signatures with Efficient Concurrent Join
- Group signatures with message-dependent opening
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- Improved short lattice signatures in the standard model
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Multi-bit Cryptosystems Based on Lattice Problems
- New directions in cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Post-Quantum Cryptography
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Simpler efficient group signatures from lattices
- Topics in Cryptology – CT-RSA 2005
- Trapdoors for hard lattices and new cryptographic constructions
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(6)- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A novel group signature scheme based on MPKC
- A Group Signature Scheme from Lattice Assumptions
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- A multi-group signature scheme from lattices
This page was built for publication: Survey of lattice-based group signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855889)