[Resource Topic] 2023/334: A Generic Transform from Multi-Round Interactive Proof to NIZK

Welcome to the resource topic for 2023/334

A Generic Transform from Multi-Round Interactive Proof to NIZK

Authors: Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois, Weiqiang Wen


We present a new generic transform that takes a multi-round interactive proof for the membership of a language \mathcal{L} and outputs a non-interactive zero-knowledge proof (not of knowledge) in the common reference string model. Similar to the Fiat-Shamir transform, it requires a hash function \mathsf{H}. However, in our transform the zero-knowledge property is in the standard model, and the adaptive soundness is in the non-programmable random oracle model (\mathsf{NPROM}).
Behind this new generic transform, we build a new generic OR-composition of two multi-round interactive proofs. Note that the two common techniques for building OR-proofs (parallel OR-proof and sequential OR-proof) cannot be naturally extended to the multi-round setting. We also give a proof of security for our OR-proof in the quantum oracle model (\mathsf{QROM}), surprisingly the security loss in \\mathsf{QROM} is independent from the number of rounds.

ePrint: https://eprint.iacr.org/2023/334

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .