From Polynomial IOP and Commitments to Non-malleable zkSNARKs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

From Polynomial IOP and Commitments to Non-malleable zkSNARKs

Antonio Faonio
  • Fonction : Auteur
  • PersonId : 1162438
Dario Fiore
Luigi Russo
Michal Zajac

Résumé

We study sufficient conditions to compile simulation-extractable zkSNARKs from information-theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove system for its oracles. Specifically, we define simulation extractability for opening and evaluation proofs of polynomial commitment schemes, which we then employ to prove the security of zkSNARKS obtained from polynomial IOP proof systems. To instantiate our methodology, we additionally prove that KZG commitments satisfy our simulation extractability requirement, despite being naturally malleable. To this end, we design a relaxed notion of simulation extractability that matches how KZG commitments are used and optimized in real-world proof systems. The proof that KZG satisfies this relaxed simulation extractability property relies on the algebraic group model and random oracle model.
Fichier principal
Vignette du fichier
camera.pdf (674.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04214668 , version 1 (22-09-2023)

Identifiants

  • HAL Id : hal-04214668 , version 1

Citer

Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac. From Polynomial IOP and Commitments to Non-malleable zkSNARKs. TCC 2023, 21st Theory of Cryptography Conference, IACR, Nov 2023, Taipei, Taiwan. ⟨hal-04214668⟩

Collections

EURECOM ANR
36 Consultations
38 Téléchargements

Partager

Gmail Facebook X LinkedIn More