单查询可验证的顺序工作量证明
Single-Query Verifiable Proof-of-Sequential-Work
摘要:
我们提出了一个顺序工作证明(PoSW),可以验证只有一个查询的随机预言机的每个随机挑战。顺序工作证明是一种协议,它有助于验证者有效地验证证明者是否顺序地执行了指定数量的计算。用N表示这个顺序计算的数量,具有poly(N)并行性的证明器必须花费$Ω(N)$ -顺序时间,而验证器使用最多O(log N)并行性在O(log N)-顺序时间内验证计算。我们提出了一个PoSW,允许任何验证,即使是一个没有并行性,验证只使用一个单一的顺序计算一个单一的挑战。所有现有的PoSW [10,5,2,6]都要求证明者计算来自随机预言机的响应序列,以对抗N轮查询。然后,证明器使用提交方案(例如,Merkle root(like)commitment)。现在,验证者要求证明者提供一组针对t个随机选择的检查点的证明,称为挑战,在计算序列中。验证者从这些证明中的每一个中找出承诺,花费O(log N)轮查询到oracle。它可以减少到一个单轮的查询,只有当验证者拥有O(log N)的并行度[6]。PoSW中的验证器不需要并行性,而是使用对随机预言机的单个查询来验证t个挑战中的每个挑战。关键的观察是,在以前的作品中的承诺计划本身需要O(log N)的Oracle查询来验证。
英文摘要:
We propose a proof-of-sequential-work (PoSW) that can be verified with only a single query to the random oracle for each random challenge. Proofs-of-sequential-work are protocols that facilitate a verifier to efficiently verify if a prover has executed a specified number of computations sequentially. Denoting this number of sequential computations with N , the prover with poly(N) parallelism must take $Ω(N)$-sequential time while the verifier verifies the computation in O(log N)-sequential time using upto O(log N) parallelism. We propose a PoSW that allows any verifier, even the one with no parallelism, to verify using just a single sequential computation on a single challenge. All the existing PoSWs [10, 5, 2, 6] mandate a prover to compute a sequence of responses from a random oracle against N-rounds of queries. Then the prover commits this sequence using a commitment scheme (e.g., Merkle root (like) commitment) predefined in the PoSWs. Now the verifier asks the prover to provide a set of proofs against t randomly chosen checkpoints, called challenges, in the computed sequence. The verifier finds out the commitment from each of these proofs spending O(log N) rounds of queries to the oracle. It can be reduced to a single round of queries only if the verifier owns O(log N) parallelism [6]. The verifier in our PoSW demands no parallelism but uses a single query to the random oracle in order to verify each of the t challenges. The key observation is that the commitment schemes themselves in the prior works demand O(log N ) oracle queries to verify.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。