1. Abe, R., Suzuki, S., Murai, J., 2018. Mitigating bitcoin node storage size by dht, in: Proceedings of the 14th Asian Internet Engineering Conference, pp. 17–23.
2. Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T., 2016. Mimc: Efficient encryption and cryptographic hashing with minimal multiplicative complexity, in: International Conference on the Theory and Application of Cryptology and Information Security, Springer. pp. 191–219.
3. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D., 2007. Provable data possession at untrusted stores, in: Proceedings of the 14th ACM conference on Computer and communications security, pp. 598–609.
4. Ateniese, G., Chen, L., Etemad, M., Tang, Q., 2020. Proof of storage-time: Efficiently checking continuous data availability. Cryptology ePrint Archive.
5. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M., 2018. Fast Reed-Solomon Interactive Oracle Proofs of Proximity, in: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. pp. 14:1–14:17. URL: http://drops.dagstuhl.de/opus/volltexte/2018/9018, doi:10.4230/LIPIcs.ICALP.2018.14.