A Generic Transform from Multi-round Interactive Proof to NIZK

Pierre Alain Fouque; Adela Georgescu; Chen Qian; Adeline Roux-Langlois; Weiqiang Wen

doi:10.1007/978-3-031-31371-4_16

A Generic Transform from Multi-round Interactive Proof to NIZK

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

University of Rennes
Department of Computer Science
University of Bucharest
Key Laboratory of Cryptologic Technology and Information Security
School of Cyber Science and Technology
Shandong University
Normandy University
Institut Polytechnique de Paris

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

4 Citations (Scopus)

Résumé

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.

langue originale	Anglais
titre	Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
rédacteurs en chef	Alexandra Boldyreva, Vladimir Kolesnikov
Editeur	Springer Science and Business Media Deutschland GmbH
Pages	461-481
Nombre de pages	21
ISBN (imprimé)	9783031313707
Les DOIs	https://doi.org/10.1007/978-3-031-31371-4_16
état	Publié - 1 janv. 2023
Modification externe	Oui
Evénement	26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023 - Atlanta, États-Unis Durée: 7 mai 2023 → 10 mai 2023

Série de publications

Nom	Lecture Notes in Computer Science
Volume	13941 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023
Pays/Territoire	États-Unis
La ville	Atlanta
période	7/05/23 → 10/05/23

Accès au document

10.1007/978-3-031-31371-4_16

Contient cette citation

Fouque, P. A., Georgescu, A., Qian, C., Roux-Langlois, A., & Wen, W. (2023). A Generic Transform from Multi-round Interactive Proof to NIZK. Dans A. Boldyreva, & V. Kolesnikov (eds.), Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (p. 461-481). (Lecture Notes in Computer Science; Vol 13941 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-31371-4_16

Fouque, Pierre Alain ; Georgescu, Adela ; Qian, Chen et al. / A Generic Transform from Multi-round Interactive Proof to NIZK. Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Editeur / Alexandra Boldyreva ; Vladimir Kolesnikov. Springer Science and Business Media Deutschland GmbH, 2023. p. 461-481 (Lecture Notes in Computer Science).

@inproceedings{27493d5934ea433fac72c433ff08bf3e,

title = "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.",

author = "Fouque, \{Pierre Alain\} and Adela Georgescu and Chen Qian and Adeline Roux-Langlois and Weiqiang Wen",

note = "Publisher Copyright: {\textcopyright} 2023, International Association for Cryptologic Research.; 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023 ; Conference date: 07-05-2023 Through 10-05-2023",

year = "2023",

month = jan,

day = "1",

doi = "10.1007/978-3-031-31371-4\_16",

language = "English",

isbn = "9783031313707",

series = "Lecture Notes in Computer Science",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "461--481",

editor = "Alexandra Boldyreva and Vladimir Kolesnikov",

booktitle = "Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings",

}

Fouque, PA, Georgescu, A, Qian, C, Roux-Langlois, A & Wen, W 2023, A Generic Transform from Multi-round Interactive Proof to NIZK. Dans A Boldyreva & V Kolesnikov (eds), Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Lecture Notes in Computer Science, VOL. 13941 LNCS, Springer Science and Business Media Deutschland GmbH, p. 461-481, 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023, Atlanta, États-Unis, 7/05/23. https://doi.org/10.1007/978-3-031-31371-4_16

A Generic Transform from Multi-round Interactive Proof to NIZK. / Fouque, Pierre Alain; Georgescu, Adela; Qian, Chen et al.
Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Ed. / Alexandra Boldyreva; Vladimir Kolesnikov. Springer Science and Business Media Deutschland GmbH, 2023. p. 461-481 (Lecture Notes in Computer Science; Vol 13941 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

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

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.

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 -

Fouque PA, Georgescu A, Qian C, Roux-Langlois A, Wen W. A Generic Transform from Multi-round Interactive Proof to NIZK. Dans Boldyreva A, Kolesnikov V, rédacteurs en chef, Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 461-481. (Lecture Notes in Computer Science). doi: 10.1007/978-3-031-31371-4_16

A Generic Transform from Multi-round Interactive Proof to NIZK

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation