Cryptology ePrint Archive: Report 2021/322

Rinocchio: SNARKs for Ring Arithmetic

Chaya Ganesh and Anca Nitulescu and Eduardo Soria-Vazquez

Abstract: Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient verification of NP computations and admit short proofs. However, all current SNARK constructions assume that the statements to be proven can be efficiently represented as either Boolean or arithmetic circuits over finite fields. For most constructions, the choice of the prime field $\mathbb{F}_p$ is limited by the existence of groups of matching order for which secure bilinear maps exist. In this work we overcome such restrictions and enable verifying computations over rings. We construct the first designated-verifier SNARK for statements which are represented as circuits over a broader kind of commutative rings, namely those containing big enough exceptional sets. Exceptional sets consist of elements such that their pairwise differences are invertible. Our contribution is threefold: We first introduce Quadratic Ring Programs (QRPs) as a characterization of NP where the arithmetic is over a ring. Second, inspired by the framework in Gennaro, Gentry, Parno and Raykova (EUROCRYPT 2013), we design SNARKs over rings in a modular way. We generalize pre-existent assumptions employed in field-restricted SNARKs to encoding schemes over rings. As our encoding notion is generic in the choice of the ring, it is amenable to different settings. Finally, we propose two applications for our SNARKs. Our first application is verifiable computation over encrypted data, specifically for evaluations of Ring- LWE-based homomorphic encryption schemes. In the second one, we use Rinocchio to naturally prove statements about circuits over e.g. $\mathbb{Z}_{2^{64}}$, which closely matches real-life computer architectures such as standard CPUs.

Category / Keywords: cryptographic protocols / Proofs and Arguments, SNARKs, Ring Arithmetic, Galois Rings, Zero Knowledge

Date: received 10 Mar 2021, last revised 17 Oct 2021

Contact author: anca at protocol ai, chaya at iisc ac in, eduardo soria-vazquez at tii ae

Available format(s): PDF | BibTeX Citation

Note: Fixed typo in author's field.

Version: 20211017:094242 (All versions of this report)

Short URL: ia.cr/2021/322


[ Cryptology ePrint archive ]