Faster explicit formulas for computing pairings over ordinary curves, EUROCRYPT 2011, vol.6632, pp.48-68, 2011. ,
Faster computation of the tate pairing, Elliptic Curve Cryptography), vol.131, pp.842-857, 2011. ,
SNARKs for C: Verifying program executions succinctly and in zero knowledge, CRYPTO 2013, Part II, vol.8043, pp.90-108, 2013. ,
Scalable zero knowledge via cycles of elliptic curves, CRYPTO 2014, Part II, vol.8617, pp.276-294, 2014. ,
Elligator: elliptic-curve points indistinguishable from uniform random strings, ACM CCS 2013, pp.967-980, 2013. ,
, New zk-SNARK elliptic curve construction, pp.12-381, 2017.
Zexe: Enabling decentralized private computation, 2020 IEEE Symposium on Security and Privacy (SP), pp.1059-1076, 2020. ,
Efficient indifferentiable hashing into ordinary elliptic curves, CRYPTO 2010, vol.6223, pp.237-254, 2010. ,
BLS-ZEXE: BLS signatures verification inside a SNARK proof, 2019. ,
Efficient computation of Tate pairing in projective coordinate over general characteristic fields, ICISC 04, vol.3506, pp.168-181, 2005. ,
Discrete logarithm problems with auxiliary inputs, Journal of Cryptology, vol.23, issue.3, pp.457-476, 2010. ,
On cycles of pairing-friendly elliptic curves, SIAM Journal on Applied Algebra and Geometry, vol.3, issue.2, pp.175-192, 2019. ,
Faster pairing computations on curves with high-degree twists, PKC 2010, vol.6056, pp.224-242, 2010. ,
Nightfall: An open source suite of tools designed to enable private token transactions over the public ethereum blockchain, 2019. ,
Indifferentiable hashing to Barreto-Naehrig curves, LATINCRYPT 2012, vol.7533, pp.1-17 ,
URL : https://hal.archives-ouvertes.fr/hal-01094321
, , 2012.
A taxonomy of pairing-friendly elliptic curves, Journal of Cryptology, vol.23, issue.2, pp.224-280, 2010. ,
Faster hashing to G2, SAC 2011, vol.7118, pp.412-430, 2012. ,
Faster point multiplication on elliptic curves with efficient endomorphisms, CRYPTO 2001, vol.2139, pp.190-200, 2001. ,
The knowledge complexity of interactive proof systems, SIAM J. Comput, vol.18, issue.1, pp.186-208, 1989. ,
On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, pp.305-326 ,
, , 2016.
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
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
Squaring in cyclotomic subgroups, Math. Comput, vol.82, issue.281, pp.555-579, 2013. ,
, ZEXE rust implementation, 2018.
An analysis of affine coordinates for pairing computation, PAIRING 2010, vol.6487, pp.1-20, 2010. ,
Coda: Decentralized cryptocurrency at scale. O(1) Labs whitepaper, 2017. ,
Construction of rational points on elliptic curves over finite fields, ANTS VII, vol.4076, pp.510-524, 2006. ,
Optimal pairings, IEEE Transactions on Information Theory, vol.56, issue.1, pp.455-461, 2010. ,
Fast and simple constant-time hashing to the BLS12-381 elliptic curve, IACR TCHES, vol.2019, issue.4, pp.154-179, 2019. ,