Publication

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

Ngoc Khanh Karol Nguyen
2022
Conference Papers

Abstract

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 use the efficient bimodal rejection sampling throughout the protocol.

Official source

https://infoscience.epfl.ch/entities/publication/17bb3c24-4373-4959-899d-3a94f0e2568e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

The topology of a chaotic attractor in the Kuramoto-Sivashinsky equation

Smart Proofs via Recursive Information Gathering: Decentralized Refereeing by Smart Contracts

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus