Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
From MaRDI portal
Publication:6104329
DOI10.1007/978-3-031-15979-4_3zbMath1517.94130OpenAlexW4312463145MaRDI QIDQ6104329
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15979-4_3
Related Items (14)
Efficient lattice-based traceable ring signature scheme with its application in blockchain ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ 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
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- More efficient commitments from structured lattice assumptions
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- 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
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- 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
- 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
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Lattice (H)IBE in the Standard Model
- Universally composable two-party and multi-party secure computation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- An Improved Compression Technique for Signatures Based on Learning with Errors
- 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
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
This page was built for publication: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
