Paper 2015/497
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
Zhangxiang Hu, Payman Mohassel, and Mike Rosulek
Abstract
We describe a zero-knowledge proof system in which a prover holds a large dataset $M$ and can repeatedly prove NP relations about that dataset. That is, for any (public) relation $R$ and $x$, the prover can prove that $\exists w: R(M,x,w)=1$. After an initial setup phase (which depends only on $M$), each proof requires only a constant number of rounds and has communication/computation cost proportional to that of a {\em random-access machine (RAM)} implementation of $R$, up to polylogarithmic factors. In particular, the cost per proof in many applications is sublinear in $|M|$. Additionally, the storage requirement between proofs for the verifier is constant.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CRYPTO 2015
- Keywords
- zero-knowledgesecure computationoblivious ramgarbled circuits
- Contact author(s)
- rosulekm @ eecs oregonstate edu
- History
- 2015-05-26: revised
- 2015-05-26: received
- See all versions
- Short URL
- https://ia.cr/2015/497
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/497,
author = {Zhangxiang Hu and Payman Mohassel and Mike Rosulek},
title = {Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/497},
year = {2015},
url = {https://eprint.iacr.org/2015/497}
}
