1. Akavia A., Bogdanov A., Guo S., Kamath A., Rosen A.: Candidate weak pseudorandom functions in ac0$$\bigcirc $$ mod2. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 251–260 (2014).
2. Alperin-Sheriff J., Apon D.: Weak is better: tightly secure short signatures from weak prfs. IACR Cryptol. ePrint Arch. (2017).
3. Ananth P., Brakerski Z., Segev G., Vaikuntanathan V.: From selective to adaptive security in functional encryption. In: Annual Cryptology Conference, pp. 657–677. Springer (2015).
4. Applebaum B.: Bootstrapping obfuscators via fast pseudorandom functions. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 162–172. Springer (2014).
5. Ball M., Holmgren J., Ishai Y., Liu T., Malkin T.: On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly prf be? In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020).