TY - GEN
T1 - A Generic Transform from Multi-round Interactive Proof to NIZK
AU - Fouque, Pierre Alain
AU - Georgescu, Adela
AU - Qian, Chen
AU - Roux-Langlois, Adeline
AU - Wen, Weiqiang
N1 - Publisher Copyright:
© 2023, International Association for Cryptologic Research.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85161700396
U2 - 10.1007/978-3-031-31371-4_16
DO - 10.1007/978-3-031-31371-4_16
M3 - Conference contribution
AN - SCOPUS:85161700396
SN - 9783031313707
T3 - Lecture Notes in Computer Science
SP - 461
EP - 481
BT - Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
A2 - Boldyreva, Alexandra
A2 - Kolesnikov, Vladimir
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023
Y2 - 7 May 2023 through 10 May 2023
ER -