D. F. Aranha and C. P. Gouvêa, RELIC is an Efficient LIbrary for Cryptography, 2013.

D. F. Aranha, P. S. Barreto, P. Longa, and J. E. Ricardini, The realm of the pairings, SAC 2013: 20th Annual International Workshop on Selected Areas in Cryptography, pp.3-25, 2013.

S. L. Paulo, M. Barreto, and . Naehrig, Pairing-friendly elliptic curves of prime order, SAC 2005: 12th Annual International Workshop on Selected Areas in Cryptography, vol.3897, pp.319-331, 2005.

D. Boneh and M. K. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology -CRYPTO, vol.2139, pp.213-229, 2001.

W. Joppe, C. Bos, M. Costello, and . Naehrig, Exponentiating in pairing groups, Cryptology ePrint Archive, 2013.

V. Boyko, M. Peinado, and R. Venkatesan, Speeding up discrete log and factoring based schemes via precomputations, Advances in Cryptology -EUROCRYPT'98, vol.1403, pp.221-235, 1998.

S. Canard, J. Devigne, and O. Sanders, Delegating a pairing can be both secure and efficient, ACNS 14: 12th International Conference on Applied Cryptography and Network Security, pp.549-565, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091145

J. Benoit-chevallier-mames, N. Coron, D. Mccullagh, M. Naccache, and . Scott, Secure delegation of elliptic-curve pairing, Cryptology ePrint Archive, 2005.

, Secure delegation of elliptic-curve pairing, Smart Card Research and Advanced Application, 9th IFIP WG 8.8/11.2 International Conference, CARDIS 2010, vol.6035, pp.24-35, 2010.

. Jean-sébastien-coron, C. David-m'raïhi, and . Tymen, Fast generation of pairs (k, [k]P ) for Koblitz elliptic curves, SAC 2001: 8th Annual International Workshop on Selected Areas in Cryptography, vol.2259, pp.151-164, 2001.

P. , A. Fouque, and M. Tibouchi, Indifferentiable hashing to Barreto-Naehrig curves, Progress in Cryptology -LAT-INCRYPT 2012: 2nd International Conference on Cryptology and Information Security in Latin America, vol.7533, pp.1-17, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01094321

M. Girault and D. Lefranc, Server-aided verification: Theory and practice, Advances in Cryptology -ASIACRYPT 2005, vol.3788, pp.605-623, 2005.

R. Granger and M. Scott, Faster squaring in the cyclotomic subgroup of sixth degree extensions, PKC 2010: 13th International Conference on Theory and Practice of Public Key Cryptography, vol.6056, pp.209-223, 2010.

A. Joux, A one round protocol for tripartite diffie-hellman, Lecture Notes in Computer Science, vol.1838, pp.385-394, 2000.

E. J. Kachisa, E. F. Schaefer, and M. Scott, Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field, PAIRING 2008: 2nd International Conference on Pairingbased Cryptography, vol.5209, pp.126-135, 2008.

Q. Phong, I. E. Nguyen, J. Shparlinski, and . Stern, Distribution of modular sums and the security of the server aided exponentiation, Cryptography and Computational Number Theory, vol.20, pp.331-342, 2001.

V. Shoup, Lower bounds for discrete logarithms and related problems, Advances in Cryptology -EUROCRYPT'97, vol.1233, pp.256-266, 1997.