可以在云中高效计算的工作量证明证书
Proof-of-work certificates that can be efficiently computed in the cloud
摘要：
在新兴的计算范例中，从处理能力到存储能力的计算能力作为基于云的服务通过通信网络提供给用户。在那里，为了限制基础设施成本，要求苛刻的计算被外包。可验证计算的思想是将一个数据结构、一个工作量证明证书与外包计算的结果相关联。这使得验证算法能够证明结果的有效性，比重新计算更快。我们讨论的是Prover（执行计算的服务器）和Verifier。Goldwasser，Kalai和Rothblum在2008年给出了一种通用的方法来验证任何可并行计算，在几乎线性的时间内，潜在的结构化输入和结果的大小。然而，证明器的计算的额外成本（以及因此对客户的额外成本），尽管几乎只是整个工作的恒定因素，但在实践中仍然是禁止的。因此，我们将在这里提出计算机代数中的特定问题程序，例如精确线性代数计算，这是证明者最优的，也就是说，具有更少的财务开销。
英文摘要：
In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a cloud-based service. There, demanding computations are outsourced in order to limit infrastructure costs. The idea of verifiable computing is to associate a data structure, a proof-of-work certificate, to the result of the outsourced computation. This allows a verification algorithm to prove the validity of the result, faster than by recomputing it. We talk about a Prover (the server performing the computations) and a Verifier. Goldwasser, Kalai and Rothblum gave in 2008 a generic method to verify any parallelizable computation, in almost linear time in the size of the, potentially structured, inputs and the result. However, the extra cost of the computations for the Prover (and therefore the extra cost to the customer), although only almost a constant factor of the overall work, is nonetheless prohibitive in practice. Differently, we will here present problem-specific procedures in computer algebra, e.g. for exact linear algebra computations, that are Prover-optimal, that is that have much less financial overhead.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
