1. P. Baecher, C. Brzuska, M. Fischlin. Notions of black-box reductions, revisited, in Advances in Cryptology—ASIACRYPT 2013, Part I. Lecture Notes in Computer Science, vol. 8269. (Springer, Heidelberg, 2013), pp. 296–315
2. M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin. Non-malleable codes for bounded depth, bounded fan-in circuits, in Advances in Cryptology - EUROCRYPT 2016—35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II (2016), pp. 881–908
3. M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988) pp. 103–112
4. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988), pp 1–10
5. M. Bellare, S. Halevi, A. Sahai, S.P. Vadhan, Many-to-one trapdoor functions and their relation to public-key cryptosystems, in Advances in Cryptology - CRYPTO ’98. Lecture Notes in Computer Science, vol. 1462 (1998), pp 283–298