Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
From MaRDI portal
Publication:6487207
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
- scientific article; zbMATH DE number 1618050 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- A Group Signature Scheme from Lattice Assumptions
- A lattice-based group signature scheme with message-dependent opening
- A new paradigm for public key identification
- Accumulating composites and improved group signing
- Bonsai trees, or how to delegate a lattice basis
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Dynamic fully anonymous short group signatures
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- 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 almost-for-free revocation
- Group signatures with message-dependent opening
- Hardness of SIS and LWE with small parameters
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- 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
- Multi-bit Cryptosystems Based on Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Policy-based signature scheme from lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Scalable group signatures with revocation
- Short accountable ring signatures based on DDH
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Simpler efficient group signatures from lattices
- Topics in Cryptology – CT-RSA 2005
- 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
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Cited in
(18)- A Group Signature Scheme from Lattice Assumptions
- 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
- A lattice-based fully dynamic group signature scheme without NIZK
- Efficient code-based fully dynamic group signature scheme
- 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
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)
