BLOOM: bimodal lattice one-out-of-many proofs and applications

DOI10.1007/978-3-031-22972-5_4zbMath1519.94169OpenAlexW4317928294MaRDI QIDQ6133965

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

zbMATH Keywords

latticeszero-knowledgering signaturesone-out-of-many proofs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

A framework for practical anonymous credentials from lattices ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE

Cites Work

• Unnamed Item
• Unnamed Item
• On the hardness of module-LWE with binary secret
• New bounds in some transference theorems in the geometry of numbers
• More efficient commitments from structured lattice assumptions
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• LWE with side information: attacks and concrete security estimation
• Practical product proofs for lattice commitments
• DualRing: generic construction of ring signatures with efficient instantiations
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• 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
• Worst-case to average-case reductions for module lattices
• 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
• Circular and KDM Security for Identity-Based Encryption
• Efficient Identity-Based Encryption over NTRU Lattices
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• Fast Fourier Orthogonalization
• Public-Key Encryption Schemes with Auxiliary Inputs
• SWIFFT: A Modest Proposal for FFT Hashing
• Trapdoors for hard lattices and new cryptographic constructions
• 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
• Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
• Short Accountable Ring Signatures Based on DDH
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Fiat-Shamir transformation of multi-round interactive proofs

This page was built for publication: BLOOM: bimodal lattice one-out-of-many proofs and applications