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_21zbMATH Open1486.94127OpenAlexW3176331104MaRDI QIDQ2128577FDOQ2128577
Authors: Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_21
Recommendations
- SETLA: Signature and Encryption from Lattices
- A simpler construction of identity-based ring signatures from lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Theory of Cryptography
Cites Work
- Lattice signatures without trapdoors
- Lattice signatures and bimodal Gaussians
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Title not available (Why is that?)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- More efficient commitments from structured lattice assumptions
- Practical product proofs for lattice commitments
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- 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
- Raptor: a practical lattice-based (linkable) ring signature
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short accountable ring signatures based on DDH
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
Cited In (25)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- 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
- One-out-of-many proofs: or how to leak a secret and spend a coin
- A note on the post-quantum security of (ring) signatures
- Lattice RingCT v2.0 with multiple input and multiple output wallets
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Compact Multi-Party Confidential Transactions
- Practical sublinear proofs for R1CS from lattices
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- On structure-preserving cryptography and lattices
- Lattice-based threshold, accountable, and private signature
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Compact ring signatures from learning with errors
- Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
- Ring signatures for deniable AKEM: Gandalf's fellowship
- Improved alternating-moduli PRFs and post-quantum signatures
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- BLOOM: bimodal lattice one-out-of-many proofs and applications
Uses Software
This page was built for publication: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128577)
