Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive analysis of time-memory tradeoff attacks on the MTP (Merkle Tree Proof) proof of work scheme in this conference talk presented at Crypto 2017. Delve into the intricacies of proof of work systems, their disadvantages, and memory-hard functions. Examine the Argon2D algorithm, Merkle Hash Trees, and Poobah's Algorithm. Understand the attacker's goals, indexing functions, and the various phases involved in the MTP scheme. Investigate the computational complexity, preprocessing, and evaluation stages of these attacks. Gain valuable insights into the security implications and potential vulnerabilities of this proof of work mechanism.