SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
From MaRDI portal
Publication:2128577
DOI10.1007/978-3-030-84245-1_21zbMath1486.94127OpenAlexW3176331104MaRDI QIDQ2128577
Ngoc Khanh Nguyen, Gregor Seiler, Vadim Lyubashevsky
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_21
Related Items (14)
Compact ring signatures from learning with errors ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ A note on the post-quantum security of (ring) signatures ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ A framework for practical anonymous credentials from lattices ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient
Uses Software
Cites Work
- Unnamed Item
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- More efficient commitments from structured lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- 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
- Raptor: a practical lattice-based (linkable) ring signature
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Short Accountable Ring Signatures Based on DDH
This page was built for publication: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
