Shorter quadratic QA-NIZK proofs

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Daza, Vanesa
• dc.contributor.author González, Alonso
• dc.contributor.author Pindado, Zaira
• dc.contributor.author Ràfols, Carla
• dc.contributor.author Silva, Javier
• dc.date.accessioned 2020-10-29T08:47:40Z
• dc.date.available 2020-10-29T08:47:40Z
• dc.date.issued 2019
• dc.description.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 aggregating 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. (ASIACRYPT’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.en
• dc.description.sponsorship A. González—Supported in part by the French ANR ALAMBIC project (ANR-16- CE39-0006). J. Silva—Supported by a PhD formation grant from the Spanish government, cofinanced by the ESF (Ayudas para contratos predoctorales para la formación de doctores 2016).
• dc.format.mimetype application/pdf
• dc.identifier.citation Daza V, González A, Pindado Z, Ràfols C, Silva J. Shorter Quadratic QA-NIZK Proofs. In: Lin D, Sako K, editors. Public-Key Cryptography – PKC 2019. 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography; 2019 Apr 14-7; Beijing, China. Berlin: Springer; 2019. p. 314-343. (LNCS; no. 11442). DOI: 10.1007/978-3-030-17253-4_11
• dc.identifier.doi http://dx.doi.org/10.1007/978-3-030-17253-4_11
• dc.identifier.issn 0302-9743
• dc.identifier.uri http://hdl.handle.net/10230/45615
• dc.language.iso eng
• dc.publisher Springer
• dc.relation.ispartof Lin D, Sako K, editors. Public-Key Cryptography – PKC 2019. 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography; 2019 Apr 14-7; Beijing, China. Berlin: Springer; 2019. p. 314-343. (LNCS; no. 11442)
• dc.rights © International Association for Cryptologic Research 2019
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.title Shorter quadratic QA-NIZK proofsen
• dc.type info:eu-repo/semantics/conferenceObject
• dc.type.version info:eu-repo/semantics/acceptedVersion