A lattice-based group signature scheme with verifier-local revocation
From MaRDI portal
Publication:1749538
DOI10.1016/j.tcs.2018.03.027zbMath1401.94163OpenAlexW2795675370MaRDI QIDQ1749538
Adeline Roux-Langlois, San Ling, Huaxiong Wang, Khoa Nguyen
Publication date: 17 May 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.027
group signatureslattice-based cryptographyverifier-local revocationzero-knowledge argumentsbonsai tree signature
Related Items (max. 100)
Traceable policy-based signatures and instantiation from lattices ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Policy-based signature scheme from lattices
- Generating shorter bases for hard random lattices
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Anonymous Attribute Tokens from Lattices
- Group Signatures with Almost-for-Free Revocation
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- An Efficient and Parallel Gaussian Sampler for Lattices
- Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
- Get Shorty via Group Signatures without Encryption
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Lattice-based Cryptography
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Advances in Cryptology – CRYPTO 2004
- Fully Anonymous Group Signatures Without Random Oracles
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Topics in Cryptology – CT-RSA 2005
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A lattice-based group signature scheme with verifier-local revocation