C. Aguilar-melchor, J. Deneuville, P. Gaborit, T. Lepoint, and T. Ricosset, Delegating elliptic-curve operations with homomorphic encryption, 2018 IEEE Conference on Communications and Network Security, pp.1-9, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01946364

S. L. Paulo, M. Barreto, and . Naehrig, Pairing-friendly elliptic curves of prime order, SAC 2005, vol.3897, pp.319-331, 2006.

P. Béguin and J. Quisquater, Fast server-aided RSA signatures secure against active attacks, LNCS, vol.963, pp.57-69, 1995.

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

S. Canard, J. Devigne, and O. Sanders, Delegating a pairing can be both secure and efficient, LNCS, vol.14, pp.549-565, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091145

B. Cavallo, G. D. Crescenzo, D. Kahrobaei, and V. Shpilrain, Efficient and secure delegation of group exponentiation to a single server, LNCS, vol.9440, pp.156-173, 2015.

C. Chevalier, F. Laguillaumie, and D. Vergnaud, Privately outsourcing exponentiation to a single server: Cryptanalysis and optimal constructions, ESORICS 2016, Part I, vol.9878, pp.261-278, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01375817

B. Chevallier-mames, J. Coron, N. Mccullagh, D. Naccache, and M. Scott, Secure delegation of elliptic-curve pairing, Cryptology ePrint Archive, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01056101

B. Chevallier-mames, J. Coron, N. Mccullagh, D. Naccache, and M. Scott, Secure delegation of elliptic-curve pairing, CARDIS 2010, pp.24-35, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01056101

G. Di-crescenzo, M. Khodjaeva, D. Kahrobaei, and V. Shpilrain, Practical and secure outsourcing of discrete log group exponentiation to a single malicious server, pp.17-28, 2017.

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

A. Guillevic and D. Vergnaud, Algorithms for outsourcing pairing computation, Smart Card Research and Advanced Applications -13th International Conference, vol.8968, pp.193-211, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01084550

S. Hohenberger and A. Lysyanskaya, How to securely outsource cryptographic computations, LNCS, vol.3378, pp.264-282, 2005.

M. Jakobsson and S. Wetzel, Secure server-aided signature generation, LNCS, vol.1992, pp.383-401, 2001.

A. Joux, A one round protocol for tripartite diffie-hellman, Algorithmic Number Theory, 4th International Symposium, ANTS-IV, 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, LNCS, vol.5209, pp.126-135, 2008.

C. Laih, S. Yen, and L. Harn, Two efficient server-aided secret computation protocols based on the addition sequence, ASIACRYPT'91, vol.739, pp.450-459, 1993.

T. Matsumoto, K. Kato, and H. Imai, Speeding up secret computations with insecure auxiliary devices, LNCS, vol.88, pp.497-506, 1990.

T. Mefenza and D. Vergnaud, Cryptanalysis of server-aided RSA protocols with private-key splitting. in submission, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02082342

T. Mefenza and D. Vergnaud, Verifiable outsourcing of pairing computations. in submission, 2018.

J. Merkle, Multi-round passive attacks on server-aided RSA protocols, ACM CCS 00, pp.102-107, 2000.

J. Merkle and R. Werchner, On the security of server-aided RSA protocols, PKC'98, vol.1431, pp.99-116, 1998.

Q. Phong, I. Nguyen, and . Shparlinski, On the insecurity of a server-aided RSA protocol, LNCS, vol.2248, pp.21-35, 2001.

B. Pfitzmann and M. Waidner, Attacks on protocols for server-aided RSA computation, LNCS, vol.92, pp.153-162, 1993.

P. P. Tsang, S. M. Sherman, S. W. Chow, and . Smith, Batch pairing delegation, LNCS, vol.4752, pp.74-90, 2007.

Y. Wang, Q. Wu, D. S. Wong, B. Qin, S. M. Sherman et al., Securely outsourcing exponentiations with single untrusted program for cloud storage, ESORICS 2014, Part I, vol.8712, pp.326-343, 2014.