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 {exist}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 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.
展开▼
机译：我们描述了一种零知识证明系统，其中一条证报包含一个大型数据集m，并且可以重复对关于该数据集的NP关系。 也就是说，对于任何（公共）关系R和X，箴言可以证明{存在} W：R（m，x，w）= 1.在初始设置阶段（仅取决于m）之后，每个证明需要 只有恒定数量的圆数，并且具有与R的随机接入机器（RAM）实现成本的通信/计算成本，其直到具有积极因素因子。 特别是，许多应用中的每种证据的成本在| M |是Sublinear。 此外，验证器的证明之间的存储要求是常量。
展开▼
