A Lattice-Based Group Signature Scheme with Message-Dependent Opening
From MaRDI portal
Publication:2822670
DOI10.1007/978-3-319-39555-5_8zbMath1346.94145OpenAlexW2472483382MaRDI QIDQ2822670
Khoa Nguyen, Fabrice Mouhartem, Benoît Libert
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01302790/file/gs-mdo.pdf
Related Items (9)
Memory lower bounds of reductions revisited ⋮ Ring signatures with user-controlled linkability ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ A lattice-based fully dynamic group signature scheme without NIZK ⋮ Improving revocation for group signature with redactable signature ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Survey of Lattice-Based Group Signature ⋮ A Practical Group Signature Scheme Based on Rank Metric
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Identity-Based Cryptosystems and Signature Schemes
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Compact Group Signatures Without Random Oracles
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Group Signatures
- The knowledge complexity of interactive proof-systems
- Applied Cryptography and Network Security
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Group Signatures with Message-Dependent Opening
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Fully Anonymous Group Signatures Without Random Oracles
- Generating Shorter Bases for Hard Random Lattices
- Group Signatures with Message-Dependent Opening in the Standard Model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Information and Communications Security
- Classical hardness of learning with errors
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A Lattice-Based Group Signature Scheme with Message-Dependent Opening
