Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
From MaRDI portal
Publication:6041285
DOI10.1007/978-3-030-92068-5_8zbMATH Open1515.94102OpenAlexW3216232750MaRDI QIDQ6041285FDOQ6041285
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
Recommendations
Cites Work
- Efficient Lattice (H)IBE in the Standard Model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lattice Signatures without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
- New bounds in some transference theorems in the geometry of numbers
- Title not available (Why is that?)
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- A Group Signature Scheme from Lattice Assumptions
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Worst-case to average-case reductions for module lattices
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Title not available (Why is that?)
- More efficient commitments from structured lattice assumptions
- Practical product proofs for lattice commitments
- One-Shot Verifiable Encryption from Lattices
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- 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
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Floppy-sized group signatures from lattices
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
Cited In (14)
- A generic construction of an anonymous reputation system and instantiations from lattices
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A framework for practical anonymous credentials from lattices
- Lattice signature with efficient protocols, application to anonymous credentials
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Practical sublinear proofs for R1CS from lattices
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Ring/module learning with errors under linear leakage -- hardness and applications
- Lattice-based threshold, accountable, and private signature
- On methods of shortening ElGamal-type signatures
- Aggregating Falcon signatures with LaBRADOR
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- BLOOM: bimodal lattice one-out-of-many proofs and applications
This page was built for publication: Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041285)
