1. Recommendation for random number generation using deterministic random bit generators. National Institute of Standards and Technology: Special Publication (2012). https://csrc.nist.gov/publications/PubsSPs.html#800-90A
2. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298–307. IEEE Computer Society Press (2003)
3. Alekhnovich, M.: More on average case vs approximation complexity. Comput. Complex. 20(4), 755–786 (2011)
4. Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles. Cryptology ePrint Archive, Report 2005/385 (2005). https://eprint.iacr.org/2005/385
5. Ateniese, G., Francati, D., Magri, B., Venturi, D.: Immunization against complete subversion without random oracles. Theor. Comput. Sci. 859, 1–36 (2021)