1. [1] M. Abe and T. Okamoto, “A signature scheme with message recovery as secure as discrete logarithm,” IEICE Trans. Fundamentals, vol.E84-A, no.1, Jan. 2001. Presented at ASIACRYPT'99.
2. [2] M. Abe, T. Okamoto, and K. Suzuki, “Message recovery signature schemes from sigma-protocols,” NTT Technical Review, vol.6, no.1, Jan. 2008.
3. [3] M. Bellare and P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols,” First ACM Conference on Computer and Communication Security, pp.62-73, Association for Computing Machinery, 1993.
4. [4] M. Bellare and P. Rogaway, “The exact security of digital signatures — How to sign with RSA and Rabin,” U. Maurer, ed., Advances in Cryptology — EUROCRYPT'96, Lect. Notes Comput. Sci., vol.1070, pp.399-416, Springer-Verlag, 1996.
5. [5] D. Brown and D. Johnson, “Formal security proofs for a signature scheme with partial message recovery,” CT-RSA 2001, Lect. Notes Comput. Sci., vol.2020, pp.126-142, Springer-Verlag, 2001.