Главная
Study mode:
on
1
Intro
2
Proof of Work
3
Disadvantages
4
Memory Hard Function
5
Argon 2D
6
MTP
7
Merkel Hash Tree
8
Poobahs Algorithm
9
Proof of Work Scheme
10
Attacker Goal
11
Indexing Function
12
Phases
13
Computational Complexity
14
Preprocessing
15
Evaluation
16
Conclusion
Description:
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.

Time Memory Tradeoff Attacks on the MTP Proof of Work Scheme

TheIACR
Add to list