### Honest Majority Multi-Prover Interactive Arguments

##### Abstract

Interactive arguments, and their (succinct) non-interactive and zero-knowledge counterparts, have seen growing deployment in real world applications in recent years. Unfortunately, for large and complex statements, concrete proof generation costs can still be quite expensive. While recent work has sought to solve this problem by outsourcing proof computation to a group of workers in a privacy preserving manner, current solutions still require each worker to do work on roughly the same order as a single-prover solution. We introduce the Honest Majority Multi-Prover (HMMP) model for interactive arguments. In these arguments, we distribute prover computation among $M$ collaborating, but distrusting, provers. All provers receive the same inputs and have no private inputs, and we allow any $t < M/2$ provers to be statically corrupted before generation of public parameters, and all communication is done via an authenticated broadcast channel. In contrast with the recent works of Ozdemir and Boneh (USENIX '22) and Dayama et al. (PETS '22), we target prover efficiency over privacy. We show that: (1) any interactive argument where the prover computation is suitably divisible into $M$ sub-computations can be transformed into an interactive argument in the HMMP model; and (2) arguments that are obtained via compiling polynomial interactive oracle proofs with polynomial commitment schemes admit HMMP model constructions that experience a (roughly) $1/M$ speedup over a single-prover solution. The transformation of (1) preserves computational (knowledge) soundness, zero-knowledge, and can be made non-interactive via the Fiat-Shamir transformation. The constructions of (2) showcase that there are efficiency gains in proof distribution when privacy is not a concern.

Note: First version of this work submitted to eprint contained an error regarding the efficiency of the verifier in our polynomial commitment scheme. This was pointed out to us by a reviewer. We have removed this error in this version of the manuscript.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Interactive Arguments Zero-Knowledge
Contact author(s)
alexander r block @ gmail com
clg @ purdue edu
History
2022-10-07: revised
See all versions
Short URL
https://ia.cr/2022/557

CC BY

BibTeX

@misc{cryptoeprint:2022/557,
author = {Alexander R.  Block and Christina Garman},
title = {Honest Majority Multi-Prover Interactive Arguments},
howpublished = {Cryptology ePrint Archive, Paper 2022/557},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/557}},
url = {https://eprint.iacr.org/2022/557}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.