Paper 2022/557
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
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.
Metadata
- Available format(s)
-
PDF
- 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
- 2022-05-10: received
- See all versions
- Short URL
- https://ia.cr/2022/557
- License
-
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}, url = {https://eprint.iacr.org/2022/557} }