1. LNCS;J.H. An,2002
2. P.S.L.M. Barreto, M. Naehrig, Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133, 2005.
http://eprint.iacr.org/
.
3. P.S.L.M. Barreto, S. Galbraith, C. O’hEigeartaigh, M. Scott, Efficient pairing computation on supersingular Abelian varieties. Cryptology ePrint Archive, Report 2004/375, 2004.
http://eprint.iacr.org/
.
4. M. Bellare, P. Rogaway, Random oracle are practical: a paradigm for designing efficient protocols. In Proceedings of ACM CCS 1993 (ACM Press, New York, 1993), pp. 62–73.
5. LNCS;M. Bellare,1996