HyperVerITAS: Verifying Image Transformations at Scale on Boolean Hypercubes
Authors: Garrett Greiner (University of Utah), Toshi Mowery (University of Notre Dame), Pratik Soni (University of Utah)
Volume: 2026
Issue: 2
Pages: 58–75
DOI: https://doi.org/10.56553/popets-2026-0036
Abstract: We present HyperVerITAS, a new zero-knowledge proof (ZKP) system for image provenance that enables scalable, efficient, and privacy-preserving verification of image transformations. HyperVerITAS builds upon the same minimal trust model as VerITAS (IEEE S&P '25), requiring trust only in the image source device, while treating the editing software as untrusted. Unlike VerITAS, which relies on FFT-intensive SNARKs and suffers from high memory overhead (up to 120 GB), HyperVerITAS leverages multilinear polynomial encodings over the Boolean hypercube to dramatically reduce both proving time and memory usage. Our design cleanly separates signature verification from image transformation, supports modular integration of multiple polynomial commitment schemes (including post-quantum constructions) and naturally extends to a wide range of affine image transformations.
We implement HyperVerITAS with two distinct commitment schemes (Brakedown and multilinear KZG) and evaluate it on full-system pipelines involving cropping and grayscaling. On commodity hardware (Apple M3, 36 GB RAM), HyperVerITAS generates proofs for 33 MP images using only 27 GB of RAM and 6.6 minutes of proving time, whereas VerITAS fails to scale beyond 4 MP. These results establish HyperVerITAS as a practical and scalable ZKP system for secure and efficient image provenance.
Keywords: zero-knowledge proofs, privacy-preserving image provenance, digital signatures
Copyright in PoPETs articles are held by their authors. This article is published under a Creative Commons Attribution 4.0 license.
