1. Lecture Notes in Computer Science;J Alwen,2016
2. Alwen, J., Blocki, J.: Towards practical attacks on Argon2i and balloon hashing. In: Proceedings of the 2nd IEEE European Symposium on Security and Privacy (EuroS&P 2017). IEEE (2017, to appear). http://eprint.iacr.org/2016/759
3. Abadi, M., Burrows, M., Wobber, T.: Moderately hard, memory-bound functions. In: Proceedings of the Network and Distributed System Security Symposium, NDSS, San Diego, California, USA (2003)
4. Alwen, J., Chen, B., Kamath, C., Kolmogorov, V., Pietrzak, K., Tessaro, S.: On the complexity of RYPT and proofs of space in the parallel random oracle model. In: Advances in Cryptology - EUROCRYPT 2016 - Vienna, Austria, May 8–12, 2016, Part II, pp. 358–387 (2016). http://eprint.iacr.org/2016/100
5. Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: RYPT is Maximally Memory-Hard. In: Advances in Cryptology-EUROCRYPT 2017. Springer (2017, to appear). http://eprint.iacr.org/2016/989