Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms

DOI10.1007/978-3-030-32101-7_24zbMATH Open1460.94047OpenAlexW2979764830MaRDI QIDQ2656918FDOQ2656918

Authors: Marcella Hastings, Nadia Heninger, Eric Wustrow 

Publication date: 17 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-32101-7_24

Recommendations

• Public Key Cryptography - PKC 2006
• A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
• Publication:5750402
• Publication:4940702
• On computing discrete logarithms in bulk and randomness extractors
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Discrete logarithms, Diffie-Hellman, and reductions
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• scientific article; zbMATH DE number 4057443

zbMATH Keywords

discrete logPollard rhoproofs of work

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (3)

• uMmine: a blockchain based on human miners
• Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
• On the application of clique problem for proof-of-work in cryptocurrencies

This page was built for publication: Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656918)