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.
CITATION STYLE
Hastings, M., Heninger, N., & Wustrow, E. (2019). Short Paper: The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11598 LNCS, pp. 396–404). Springer. https://doi.org/10.1007/978-3-030-32101-7_24
Mendeley helps you to discover research relevant for your work.