Simpler efficient group signatures from lattices
From MaRDI portal
Recommendations
Cited in
(42)- On new zero-knowledge arguments for attribute-based group signatures from lattices
- Memory lower bounds of reductions revisited
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Floppy-sized group signatures from lattices
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Constant-size group signatures from lattices
- Integral matrix Gram root and lattice Gaussian sampling without floats
- \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme
- Security analysis of DGM and GM group signature schemes instantiated with XMSS-T
- A rank metric code-based group signature scheme
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- A lattice-based group signature scheme with message-dependent opening
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Lattice-based group signatures with logarithmic signature size
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- 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
- Policy-based signature scheme from lattices
- Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- A code-based group signature scheme
- A practical group signature scheme based on rank metric
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- scientific article; zbMATH DE number 5785870 (Why is no real title available?)
- Survey of lattice-based group signature
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Lattice signature with efficient protocols, application to anonymous credentials
- Lattice-based programmable hash functions and applications
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- A multi-group signature scheme from lattices
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Module lattice based constant-size group signature with verifier local revocation and backward unlinkability
- Lattice-based group signatures in the standard model, revisited
- A scalable post-quantum hash-based group signature
This page was built for publication: Simpler efficient group signatures from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941202)
