Sublinear Zero-Knowledge Arguments for RAM Programs
Sublinear Zero-Knowledge Arguments for RAM Programs
复制标题
RAM 程序的次线性零知识论证
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Alessandra Scafuro
中科院分区：
文献类型：
--
作者：
Payman Mohassel;Mike Rosulek;Alessandra Scafuro
我们描述了一个新的简洁的零知识参数协议，具有以下属性。证明者提交一个大的数据集M，然后可以证明许多形式为\（\exists w：\mathcal {R}_i（M，w）=1\）的陈述，其中\（\mathcal {R}_i\）是一个公共函数。该协议是简洁的，在这个意义上，验证者的成本（在计算和通信）不取决于|M|在每个证明中，证明者和验证者的计算/通信成本仅与实现\（\mathcal {R}_i\）的不经意RAM程序的运行时间成比例（特别是，这可以是次线性的）。|M|).唯一的成本，规模与|M|是证明者在对M的一次性初始承诺中的计算成本。
We describe a new succinct zero-knowledge argument protocol with the following properties. The prover commits to a large data-set M, and can thereafter prove many statements of the form \(\exists w : \mathcal {R}_i(M,w)=1\), where \(\mathcal {R}_i\) is a public function. The protocol is succinct in the sense that the cost for the verifier (in computation & communication) does not depend on |M|, not even in any initialization phase In each proof, the computation/communication cost for both the prover and the verifier is proportional only to the running time of an oblivious RAM program implementing \(\mathcal {R}_i\) (in particular, this can be sublinear in |M|). The only costs that scale with |M| are the computational costs of the prover in a one-time initial commitment to M.
黑盒乱码RAM
DOI：
--
发表时间：
2015
期刊：
Annual Symposium on Foundations of Computer Science
影响因子：
--
作者：
Garg, Sanjam;Lu, Steve;Ostrovsky, Rafail
通讯作者：
Ostrovsky, Rafail