BLOOM: bimodal lattice one-out-of-many proofs and applications
From MaRDI portal
Publication:6133965
DOI10.1007/978-3-031-22972-5_4zbMATH Open1519.94169OpenAlexW4317928294MaRDI QIDQ6133965FDOQ6133965
Vadim Lyubashevsky, Ngoc Khanh Nguyen
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_4
Recommendations
- Two blossoming proofs of the Lane-Riesenfeld algorithm
- Formal Methods in Computer-Aided Design
- Pseudoaffinity, de Boor algorithm, and blossoms
- On de Boor-like algorithms and blossoming
- Regular multi-types and the Bloom conjecture
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Proof mining in \(L_{1}\)-approximation
- New (and old) proof systems for lattice problems
- Hardened bloom filters, with an application to unobservability
- On the complexity of computing probabilistic bisimilarity
Cites Work
- SWIFFT: A Modest Proposal for FFT Hashing
- Title not available (Why is that?)
- Trapdoors for hard lattices and new cryptographic constructions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Lattice Signatures without Trapdoors
- New bounds in some transference theorems in the geometry of numbers
- Public-Key Encryption Schemes with Auxiliary Inputs
- Lattice Signatures and Bimodal Gaussians
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Worst-case to average-case reductions for module lattices
- Efficient Identity-Based Encryption over NTRU Lattices
- More efficient commitments from structured lattice assumptions
- LWE with side information: attacks and concrete security estimation
- Practical product proofs for lattice commitments
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- On the hardness of module-LWE with binary secret
- 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
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- DualRing: generic construction of ring signatures with efficient instantiations
- Fiat-Shamir transformation of multi-round interactive proofs
- Circular and KDM Security for Identity-Based Encryption
- Fast Fourier Orthogonalization
- 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
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
Cited In (5)
- A framework for practical anonymous credentials from lattices
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Lattice-based threshold, accountable, and private signature
- Short code-based one-out-of-many proofs and applications
This page was built for publication: BLOOM: bimodal lattice one-out-of-many proofs and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133965)
