BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications

ePrint Report: BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications

Vadim Lyubashevsky, Ngoc Khan Nguyen

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Lyubashevsky et al. (Crypto 2022) together with an improved, over prior lattice-based one-out-of-many proofs, recursive procedure, and a novel rejection sampling proof that allows to …

applications eprint report