Shorter Quadratic QA-NIZK Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Shorter Quadratic QA-NIZK Proofs


Despite recent advances in the area of pairing-friendly Non-Interactive Zero-Knowledge proofs, there have not been many efficiency improvements in constructing arguments of satisfiability of quadratic (and larger degree) equations since the publication of the Groth-Sahai proof system (JoC'12). In this work, we address the problem of aggre-gating such proofs using techniques derived from the interactive setting and recent constructions of SNARKs. For certain types of quadratic equations, this problem was investigated before by González et al. (ASI-ACRYPT'15). Compared to their result, we reduce the proof size by approximately 50% and the common reference string from quadratic to linear, at the price of using less standard computational assumptions. A theoretical motivation for our work is to investigate how efficient NIZK proofs based on falsifiable assumptions can be. On the practical side, quadratic equations appear naturally in several cryptographic schemes like shuffle and range arguments.
Fichier principal
Vignette du fichier
mainZKbits.pdf (540.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02399179 , version 1 (08-12-2019)



Vanesa Daza, Alonso González, Zaira Pindado, Carla Ràfols, Javier Silva. Shorter Quadratic QA-NIZK Proofs. PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Apr 2019, Beijing, China. pp.314-343, ⟨10.1007/978-3-030-17253-4_11⟩. ⟨hal-02399179⟩
35 View
148 Download



Gmail Facebook X LinkedIn More