Rinocchio: SNARKs for Ring Arithmetic

Ganesh, C and Nitulescu, A and Soria-Vazquez, E (2023) Rinocchio: SNARKs for Ring Arithmetic. In: Journal of Cryptology, 36 (4).

PDF jou_cry_36-4_2023.pdf - Published Version Restricted to Registered users only Download (830kB) | Request a copy

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 Fp 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. Our contribution is threefold: 1.We first introduce Quadratic Ring Programs (QRPs) as a characterization of NP where the arithmetic is over a ring.2.Second, inspired by the framework in Gennaro et al. (in: Johansson and Nguyen (eds) EUROCRYPT 2013, volume 7881 of LNCS, pp 626�645. Springer, Heidelberg, 2013), we design SNARKs over rings in a modular way. We generalize preexistent 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.3.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., Z264 , which closely matches real-life computer architectures such as standard CPUs. © 2023, International Association for Cryptologic Research.

Item Type:	Journal Article
Publication:	Journal of Cryptology
Publisher:	Springer
Additional Information:	The copyright for this article belongs to the Springer.
Keywords:	Algebra; Computer architecture; Cryptography; Program processors; Signal encoding, 'current; Arithmetic circuit; Boolean circuit; Finite fields; Ho-momorphic encryptions; Homomorphic-encryptions; Knowledge construction; Prime field; Succinct non-interactive argument of knowledge; Zero knowledge, Encoding (symbols)
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	15 Dec 2023 11:12
Last Modified:	15 Dec 2023 11:12
URI:	https://eprints.iisc.ac.in/id/eprint/83397

Actions (login required)

View Item