论文信息 - Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme

Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme

Proof-of-work (PoW) schemes are cryptographic primitives with numerous applications, and in particular, they play a crucial role in maintaining consensus in cryptocurrency networks. Ideally, a cryptocurrency PoW scheme should have several desired properties, including efficient verification on one hand, and high memory consumption of the prover’s algorithm on the other hand, making the scheme less attractive for implementation on dedicated hardware.

Itai Dinur | Niv Nadler

[1] Eli Biham,et al. A Framework for Iterative Hash Functions - HAIFA , 2007, IACR Cryptol. ePrint Arch..

[2] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.

[3] Alex Biryukov,et al. Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).

[4] Samuel Neves,et al. BLAKE2: Simpler, Smaller, Fast as MD5 , 2013, ACNS.

[5] Jeremiah Blocki,et al. Efficiently Computing Data-Independent Memory-Hard Functions , 2016, CRYPTO.

[6] Giuseppe Ateniese,et al. Proofs of Space: When Space Is of the Essence , 2014, SCN.

[7] Salil P. Vadhan,et al. Publicly verifiable proofs of sequential work , 2013, ITCS '13.

[8] W. Bolt. Bitcoin and Cryptocurrency Technologies : A Comprehensive Introduction , 2017 .

[9] Stefan Dziembowski,et al. Proofs of Space , 2015, CRYPTO.

[10] Alex Biryukov,et al. Egalitarian Computing , 2016, USENIX Security Symposium.

[11] Colin Percival. STRONGER KEY DERIVATION VIA SEQUENTIAL MEMORY-HARD FUNCTIONS , 2009 .

[12] Jeremiah Blocki,et al. Towards Practical Attacks on Argon2i and Balloon Hashing , 2017, 2017 IEEE European Symposium on Security and Privacy (EuroS&P).

[13] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.