International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Efficient NIZKs for Algebraic Sets

Geoffroy Couteau , CNRS, IRIF, Université de Paris, France
Helger Lipmaa , Simula UiB, Norway
Roberto Parisella , Simula UiB, Norway
Arne Tobias Ødegaard , Simula UiB, Norway
DOI: 10.1007/978-3-030-92078-4_5
Search ePrint
Search Google
Conference: ASIACRYPT 2021
Abstract: Significantly extending the framework of (Couteau and Hartmann, Crypto 2020), we propose a general methodology to construct NIZKs for showing that an encrypted vector $\vec{\chi}$ belongs to an algebraic set, i.e., is in the zero locus of an ideal $\mathscr{I}$ of a polynomial ring. In the case where $\mathscr{I}$ is principal, i.e., generated by a single polynomial $F$, we first construct a matrix that is a ``quasideterminantal representation'' of $F$ and then a NIZK argument to show that $F (\vec{\chi}) = 0$. This leads to compact NIZKs for general computational structures, such as polynomial-size algebraic branching programs. We extend the framework to the case where $\IDEAL$ is non-principal, obtaining efficient NIZKs for R1CS, arithmetic constraint satisfaction systems, and thus for $\mathsf{NP}$. As an independent result, we explicitly describe the corresponding language of ciphertexts as an algebraic language, with smaller parameters than in previous constructions that were based on the disjunction of algebraic languages. This results in an efficient GL-SPHF for algebraic branching programs.
Video from ASIACRYPT 2021
  title={Efficient NIZKs for Algebraic Sets},
  author={Geoffroy Couteau and Helger Lipmaa and Roberto Parisella and Arne Tobias Ødegaard},