International Association for Cryptologic Research

International Association
for Cryptologic Research


A Generic Transform from Multi-Round Interactive Proof to NIZK

Pierre-Alain Fouque , Rennes University, CNRS, INRIA, France
Adela Georgescu , Department of Computer Science, University of Bucharest, Romania
Chen Qian , Shandong University, China
Adeline Roux-Langlois , Normandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, France
Weiqiang Wen , LTCI, Telecom Paris, Institut Polytechnique de Paris, France
DOI: 10.1007/978-3-031-31371-4_16
Search ePrint
Search Google
Presentation: Slides
Conference: PKC 2023
Abstract: We present a new generic transform that takes a multi-round interactive proof for the membership of a language 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 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 (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 (QROM), surprisingly the security loss in QROM is independent from the number of rounds.
  title={A Generic Transform from Multi-Round Interactive Proof to NIZK},
  author={Pierre-Alain Fouque and Adela Georgescu and Chen Qian and Adeline Roux-Langlois and Weiqiang Wen},