[Resource Topic] 2023/1342: Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing

Welcome to the resource topic for 2023/1342

Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing

Authors: David Balbás, Dario Fiore, Maria Isabel González Vasco, Damien Robissout, Claudio Soriente


Cryptographic proof systems provide integrity, fairness, and privacy in applications that outsource data processing tasks. However, general-purpose proof systems do not scale well to large inputs. At the same time, ad-hoc solutions for concrete applications - e.g., machine learning or image processing - are more efficient but lack modularity, hence they are hard to extend or to compose with other tools of a data-processing pipeline.

In this paper, we combine the performance of tailored solutions with the versatility of general-purpose proof systems. We do so by introducing a modular framework for verifiable computation of sequential operations. The main tool of our framework is a new information-theoretic primitive called Verifiable Evaluation Scheme on Fingerprinted Data (VE) that captures the properties of diverse sumcheck-based interactive proofs, including the well-established GKR protocol. Thus, we show how to compose VEs for specific functions to obtain verifiability of a data-processing pipeline.

We propose a novel VE for convolution operations that can handle multiple input-output channels and batching, and we use it in our framework to build proofs for (convolutional) neural networks and image processing. We realize a prototype implementation of our proof systems, and show that we achieve up to 5 \times faster proving time and 10 \times shorter proofs compared to the state-of-the-art, in addition to asymptotic improvements.

ePrint: https://eprint.iacr.org/2023/1342

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .