Paper 2015/497

Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost

Zhangxiang Hu, Payman Mohassel, and Mike Rosulek


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.

Available format(s)
Cryptographic protocols
Publication info
Published by the IACR in CRYPTO 2015
zero-knowledgesecure computationoblivious ramgarbled circuits
Contact author(s)
rosulekm @ eecs oregonstate edu
2015-05-26: revised
2015-05-26: received
See all versions
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.