1. Martin R. Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016, Proceedings, Part I (LNCS, Vol. 10031). Springer, 191--219.
2. Paulo S. L. M. Barreto and Michael Naehrig. 2005. Pairing-Friendly Elliptic Curves of Prime Order. In SAC 2005 (LNCS, Vol. 3897). Springer, 319--331.
3. Alexandre Belling, Azam Soleimanian, and Olivier Bégassat. 2022. Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification. IACR Cryptol. ePrint Arch. (2022), 1072.
4. Eli Ben-sasson, Alessandro Chiesa, and Nicholas Spooner. 2016. Interactive Oracle Proofs. In TCC 2016-B (LNCS, Vol. 9986). Springer, 31--60.
5. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV