BLOOM: bimodal lattice one-out-of-many proofs and applications
From MaRDI portal
Publication:6133965
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
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Circular and KDM security for identity-based encryption
- DualRing: generic construction of ring signatures with efficient instantiations
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Fast Fourier orthogonalization
- Fiat-Shamir transformation of multi-round interactive proofs
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- LWE with side information: attacks and concrete security estimation
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- More efficient commitments from structured lattice assumptions
- New bounds in some transference theorems in the geometry of numbers
- On the hardness of module-LWE with binary secret
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Public-key encryption schemes with auxiliary inputs
- Raptor: a practical lattice-based (linkable) ring signature
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- SWIFFT: A Modest Proposal for FFT Hashing
- Short accountable ring signatures based on DDH
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Trapdoors for hard lattices and new cryptographic constructions
- Worst-case to average-case reductions for module lattices
Cited in
(7)- A framework for practical anonymous credentials from lattices
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- 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)
