Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
From MaRDI portal
Recommendations
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- A Group Signature Scheme from Lattice Assumptions
- Group signature from lattices preserving forward security in dynamic setting
- Simpler efficient group signatures from lattices
- Forward-secure group signatures from lattices
- Lattice-based group signatures with logarithmic signature size
- A lattice-based fully dynamic group signature scheme without NIZK
- scientific article; zbMATH DE number 2204022
- Survey of lattice-based group signature
Cites work
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- A provably secure group signature scheme from code-based assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Attribute-based encryption for circuits
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Bonsai trees, or how to delegate a lattice basis
- Classical hardness of learning with errors
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Compact E-Cash
- Compact Group Signatures Without Random Oracles
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Confined guessing: new signatures from standard assumptions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Dynamic fully anonymous short group signatures
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient lattice (H)IBE in the standard model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Formal treatment of privacy-enhancing credential systems
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Fully Anonymous Attribute Tokens from Lattices
- Fully Anonymous Group Signatures Without Random Oracles
- Fully homomorphic encryption using ideal lattices
- Generating shorter bases for hard random lattices
- GGHLite: more efficient multilinear maps from ideal lattices
- Group Encryption
- Group Signatures
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Group Signatures with Efficient Concurrent Join
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- 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
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New bounds in some transference theorems in the geometry of numbers
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the Portability of Generalized Schnorr Proofs
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- P-signatures and Noninteractive Anonymous Credentials
- Predicate encryption for circuits from LWE
- Public-key cryptosystems from the worst-case shortest vector problem
- Public-Key Encryption with Non-interactive Opening
- Randomizable Proofs and Delegatable Anonymous Credentials
- Short and Stateless Signatures from the RSA Assumption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Simpler efficient group signatures from lattices
- Streaming authenticated data structures
- Structure-preserving signatures and commitments to group elements
- The knowledge complexity of interactive proof-systems
- Topics in Cryptology – CT-RSA 2005
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Universally Composable Adaptive Oblivious Transfer
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(60)- Memory lower bounds of reductions revisited
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A lattice-based group signature scheme with verifier-local revocation
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Access control encryption from group encryption
- Zero-knowledge proofs for committed symmetric Boolean functions
- Black-box accumulation based on lattices
- \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
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices
- Foundations of fully dynamic group signatures
- Group signature from lattices preserving forward security in dynamic setting
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Asymptotically efficient lattice-based digital signatures
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Lattice-based e-cash, revisited
- Secret handshakes: full dynamicity, deniability and lattice-based design
- A lattice-based group signature scheme with message-dependent opening
- 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
- Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
- Designated verifier signature scheme based on braid group
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- A code-based group signature scheme
- Survey of lattice-based group signature
- Adaptive oblivious transfer with access control from lattice assumptions
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Multimodal private signatures
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- Verifiable Decryption for Fully Homomorphic Encryption
- 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
- A framework for practical anonymous credentials from lattices
- Forward-secure revocable secret handshakes from lattices
- Efficient code-based fully dynamic group signature scheme
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Forward-Secure Group Encryptions from Lattices
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- Secure Stern Signatures in Quantum Random Oracle Model
- A multi-group signature scheme from lattices
- A generic construction of an anonymous reputation system and instantiations from lattices
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Fully dynamic attribute-based signatures for circuits from codes
- Ring/module learning with errors under linear leakage -- hardness and applications
- Lattice-based threshold, accountable, and private signature
- Module lattice based constant-size group signature with verifier local revocation and backward unlinkability
- Improved lattice blind signatures from recycled entropy
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Anonymous reputation systems with revocation, revisited
- Phoenix: hash-and-sign with aborts from lattice gadgets
- Lattice-based group signatures in the standard model, revisited
- Anonymous reputation systems with revocation, revisited
This page was built for publication: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953783)
