Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
From MaRDI portal
Publication:6041285
DOI10.1007/978-3-030-92068-5_8zbMath1515.94102OpenAlexW3216232750MaRDI QIDQ6041285
Maxime Plançon, Gregor Seiler, Vadim Lyubashevsky, Ngoc Khanh Nguyen
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_8
Related Items (8)
Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE
Cites Work
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- Floppy-sized group signatures from lattices
- More efficient commitments from structured lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Worst-case to average-case reductions for module lattices
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice Signatures and Bimodal Gaussians
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- A Group Signature Scheme from Lattice Assumptions
- Efficient Lattice (H)IBE in the Standard Model
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- One-Shot Verifiable Encryption from Lattices
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
