Skip to Main content Skip to Navigation
New interface
Conference papers

Shorter Quadratic QA-NIZK Proofs

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Alonso González Connect in order to contact the contributor
Submitted on : Sunday, December 8, 2019 - 11:50:26 PM
Last modification on : Tuesday, October 25, 2022 - 4:23:56 PM
Long-term archiving on: : Monday, March 9, 2020 - 1:03:58 PM


Files produced by the author(s)




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⟩



Record views


Files downloads