Short Paper: The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms
Short Paper: The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms
复制标题
短论文：证明就在布丁中：解决离散对数的工作证明
DOI：
10.1007/978-3-030-32101-7_24
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Wustrow, Eric
中科院分区：
文献类型：
--
作者：
Hastings, Marcella;Heninger, Nadia;Wustrow, Eric
我们提出了一个工作量证明协议，该协议计算循环群中元素的离散对数。生成工作证明的个人证明器执行Pollard rho算法的分布式版本。这样的协议可以捕获用于构建基于工作量证明的区块链的计算能力，以实现更有用的目的，并激励硬件，软件或算法的进步，以解决重要的加密问题。我们描述了我们提出的构造，并详细说明了在设计实际工作量证明时出现的挑战和潜在的权衡。
We propose a proof of work protocol that computes the discrete logarithm of an element in a cyclic group. Individual provers generating proofs of work perform a distributed version of the Pollard rho algorithm. Such a protocol could capture the computational power expended to construct proof-of-work-based blockchains for a more useful purpose, as well as incentivize advances in hardware, software, or algorithms for an important cryptographic problem. We describe our proposed construction and elaborate on challenges and potential trade-offs that arise in designing a practical proof of work.