1. Schnorrkel library, January 2020. https://github.com/w3f/schnorrkel/commit/fa6c35f832
2. Bagherzandi, A., Cheon, J.-H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 449–458 (2008)
3. Lecture Notes in Computer Science;A Bagherzandi,2008
4. Bellare, M., Dai, W.: The multi-base discrete logarithm problem: Concrete security improvements for Schnorr identification, signatures and multi-signatures. IACR Cryptology ePrint Archive 2020:416 (2020)
5. Bellare, N., Pointcheval, S.: The one-more-RSA-inversion problems and the security of Chaum’s blind signature scheme. J. Cryptol. 16(3), 185–215 (2003). https://doi.org/10.1007/s00145-002-0120-1