A Generic Transform from Multi-Round Interactive Proof to NIZK - GREYC amacc Access content directly
Conference Papers Year : 2023

A Generic Transform from Multi-Round Interactive Proof to NIZK

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.
Fichier principal
Vignette du fichier
PKC_2023.pdf (519.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04163128 , version 1 (17-07-2023)

Licence

Identifiers

Cite

Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois, Weiqiang Wen. A Generic Transform from Multi-Round Interactive Proof to NIZK. PKC 2023 - International Conference on Practice and Theory of Public-Key Cryptography, May 2023, Atlanta, United States. pp.461-481, ⟨10.1007/978-3-031-31371-4_16⟩. ⟨hal-04163128⟩
78 View
47 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More