A Note on Non-Interactive Zero-Knowledge from CDH - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Note on Non-Interactive Zero-Knowledge from CDH

Abhishek Jain
  • Fonction : Auteur
Zhengzhong Jin
  • Fonction : Auteur
Willy Quach
  • Fonction : Auteur

Résumé

We build non-interactive zero-knowledge (NIZK) and ZAP arguments for all NP where soundness holds for infinitely-many security parameters, and against uniform adversaries, assuming the subexponential hardness of the Computational Diffie-Hellman (CDH) assumption. We additionally prove the existence of NIZK arguments with these same properties assuming the polynomial hardness of both CDH and the Learning Parity with Noise (LPN) assumption. In both cases, the CDH assumption does not require a group equipped with a pairing. Infinitely-often uniform security is a standard byproduct of commonly used non-black-box techniques that build on disjunction arguments on the (in)security of some primitive. In the course of proving our results, we develop a new variant of this non-black-box technique that yields improved guarantees: we obtain explicit constructions (previous works generally only obtained existential results) where security holds for a relatively dense set of security parameters (as opposed to an arbitrary infinite set of security parameters). We demonstrate that our technique can have applications beyond our main results.
Fichier principal
Vignette du fichier
2023-970.pdf (664.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04265640 , version 1 (31-10-2023)

Identifiants

Citer

Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach. A Note on Non-Interactive Zero-Knowledge from CDH. 43rd Annual International Cryptology Conference, CRYPTO 2023,, Aug 2023, Santa Barbara (CA), France. pp.731-764, ⟨10.1007/978-3-031-38551-3_23⟩. ⟨hal-04265640⟩
26 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More