D. F. Aranha, K. Karabina, P. Longa, C. H. Gebotys, and J. C. López-hernández, Faster explicit formulas for computing pairings over ordinary curves, EUROCRYPT 2011, vol.6632, pp.48-68, 2011.

C. Arène, T. Lange, M. Naehrig, and C. Ritzenthaler, Faster computation of the tate pairing, Elliptic Curve Cryptography), vol.131, pp.842-857, 2011.

E. Ben-sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, SNARKs for C: Verifying program executions succinctly and in zero knowledge, CRYPTO 2013, Part II, vol.8043, pp.90-108, 2013.

E. Ben-sasson, A. Chiesa, E. Tromer, and M. Virza, Scalable zero knowledge via cycles of elliptic curves, CRYPTO 2014, Part II, vol.8617, pp.276-294, 2014.

D. J. Bernstein, M. Hamburg, A. Krasnova, and T. Lange, Elligator: elliptic-curve points indistinguishable from uniform random strings, ACM CCS 2013, pp.967-980, 2013.

S. Bowe, New zk-SNARK elliptic curve construction, pp.12-381, 2017.

S. Bowe, A. Chiesa, M. Green, I. Miers, P. Mishra et al., Zexe: Enabling decentralized private computation, 2020 IEEE Symposium on Security and Privacy (SP), pp.1059-1076, 2020.

E. Brier, J. S. Coron, T. Icart, D. Madore, H. Randriam et al., Efficient indifferentiable hashing into ordinary elliptic curves, CRYPTO 2010, vol.6223, pp.237-254, 2010.

. Celo, BLS-ZEXE: BLS signatures verification inside a SNARK proof, 2019.

S. Chatterjee, P. Sarkar, and R. Barua, Efficient computation of Tate pairing in projective coordinate over general characteristic fields, ICISC 04, vol.3506, pp.168-181, 2005.

J. H. Cheon, Discrete logarithm problems with auxiliary inputs, Journal of Cryptology, vol.23, issue.3, pp.457-476, 2010.

A. Chiesa, L. Chua, and M. Weidner, On cycles of pairing-friendly elliptic curves, SIAM Journal on Applied Algebra and Geometry, vol.3, issue.2, pp.175-192, 2019.

C. Costello, T. Lange, and M. Naehrig, Faster pairing computations on curves with high-degree twists, PKC 2010, vol.6056, pp.224-242, 2010.

. Ey-blockchain, Nightfall: An open source suite of tools designed to enable private token transactions over the public ethereum blockchain, 2019.

P. A. Fouque and M. Tibouchi, Indifferentiable hashing to Barreto-Naehrig curves, LATINCRYPT 2012, vol.7533, pp.1-17
URL : https://hal.archives-ouvertes.fr/hal-01094321

, , 2012.

D. Freeman, M. Scott, and E. Teske, A taxonomy of pairing-friendly elliptic curves, Journal of Cryptology, vol.23, issue.2, pp.224-280, 2010.

L. Fuentes-castañeda, E. Knapp, and F. Rodríguez-henríquez, Faster hashing to G2, SAC 2011, vol.7118, pp.412-430, 2012.

R. P. Gallant, R. J. Lambert, and S. A. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms, CRYPTO 2001, vol.2139, pp.190-200, 2001.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput, vol.18, issue.1, pp.186-208, 1989.

J. Groth, On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, pp.305-326

, , 2016.

A. Guillevic, S. Masson, and E. Thomé, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, Des. Codes Cryptogr, vol.88, pp.1047-1081, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02305051

A. Guillevic and S. Singh, On the alpha value of polynomials in the tower number field sieve algorithm. Cryptology ePrint Archive, vol.885, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02263098

K. Karabina, Squaring in cyclotomic subgroups, Math. Comput, vol.82, issue.281, pp.555-579, 2013.

, ZEXE rust implementation, 2018.

K. Lauter, P. L. Montgomery, and M. Naehrig, An analysis of affine coordinates for pairing computation, PAIRING 2010, vol.6487, pp.1-20, 2010.

I. Meckler and E. Shapiro, Coda: Decentralized cryptocurrency at scale. O(1) Labs whitepaper, 2017.

A. Shallue and C. E. Van-de-woestijne, Construction of rational points on elliptic curves over finite fields, ANTS VII, vol.4076, pp.510-524, 2006.

F. Vercauteren, Optimal pairings, IEEE Transactions on Information Theory, vol.56, issue.1, pp.455-461, 2010.

R. S. Wahby and D. Boneh, Fast and simple constant-time hashing to the BLS12-381 elliptic curve, IACR TCHES, vol.2019, issue.4, pp.154-179, 2019.