Scrypt Is Maximally Memory-Hard-Reference-Cited by-同舟云学术

Scrypt Is Maximally Memory-Hard

Published:2017 Issue: Volume: Page:33-62
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alwen Joël,Chen Binyi,Pietrzak Krzysztof,Reyzin Leonid,Tessaro Stefano

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-56617-7_2

Reference24 articles.

1. Abadi, M., Burrows, M., Manasse, M.S., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. 5(2), 299–327 (2005)

2. Abadi, M., Burrows, M., Wobber, T.: Moderately hard and memory-bound functions. In: NDSS 2003. The Internet Society, February 2003

3. Lecture Notes in Computer Science;J Alwen,2016

4. Alwen, J., Blocki, J., Pietrzak, K.: Depth-robust graphs and their cumulative memory complexity. In: EUROCRYPT (2017)

5. Alwen, J., Chen, B., Kamath, C., Kolmogorov, V., Pietrzak, K., Tessaro, S.: On the complexity of scrypt and proofs of space in the parallel random oracle model. Cryptology ePrint Archive, report 2016/100 (2016). http://eprint.iacr.org/2016/100

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parola Saklama Tekniklerinin Evrimi ve Güncel En İyi Uygulamaları;Eskişehir Türk Dünyası Uygulama ve Araştırma Merkezi Bilişim Dergisi;2023-12-27

2. Instant Function Calls Using Synchronized Cross-Blockchain Smart Contracts;IEEE Transactions on Network and Service Management;2023-09

3. Quantum-resistant Blockchain Cryptography-based Smart City Transactions;Proceedings of the 2023 Fifteenth International Conference on Contemporary Computing;2023-08-03

4. Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity;Lecture Notes in Computer Science;2023

5. Individual Cryptography;Advances in Cryptology – CRYPTO 2023;2023