J. Baek and Y. Zheng, Identity-Based Threshold Decryption, Public Key Cryptography, pp.262-276, 2004.
DOI : 10.1007/978-3-540-24632-9_19

P. S. Barreto, B. Lynn, and M. Scott, Constructing Elliptic Curves with Prescribed Embedding Degrees, Lecture Notes in Computer Science, vol.2576, pp.257-267, 2002.
DOI : 10.1007/3-540-36413-7_19

P. S. Barreto and M. Naehrig, Pairing-Friendly Elliptic Curves of Prime Order, Selected Areas in Cryptography, pp.319-331, 2005.
DOI : 10.1007/11693383_22

G. Barthe, B. Grégoire, S. Heraud, F. Olmedo, and S. Zanella-béguelin, Verified indifferentiable hashing into elliptic curves, Journal of Computer Security, vol.21, issue.6, pp.209-228, 2012.
DOI : 10.3233/JCS-130476
URL : https://hal.archives-ouvertes.fr/hal-00765874

A. Boldyreva, Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, Lecture Notes in Computer Science, vol.2567, pp.31-46, 2003.
DOI : 10.1007/3-540-36288-6_3

D. Boneh and M. K. Franklin, Identity-Based Encryption from the Weil Pairing, Lecture Notes in Computer Science, vol.2139, pp.213-229, 2001.
DOI : 10.1007/3-540-44647-8_13

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, Lecture Notes in Computer Science, vol.2656, pp.416-432, 2003.
DOI : 10.1007/3-540-39200-9_26

D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing, Lecture Notes in Computer Science, vol.2248, pp.514-532, 2001.
DOI : 10.1007/3-540-45682-1_30

D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, J. Cryptology, vol.17, issue.4, pp.297-319, 2004.

X. Boyen, Multipurpose Identity-Based Signcryption, Lecture Notes in Computer Science, vol.2729, pp.383-399, 2003.
DOI : 10.1007/978-3-540-45146-4_23

V. Boyko, P. D. Mackenzie, and S. Patel, Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman, Lecture Notes in Computer Science, vol.1807, pp.156-171, 2000.
DOI : 10.1007/3-540-45539-6_12

E. Brier, J. Coron, T. Icart, D. Madore, H. Randriam et al., Efficient Indifferentiable Hashing into Ordinary Elliptic Curves, Lecture Notes in Computer Science, vol.6223, pp.237-254, 2010.
DOI : 10.1007/978-3-642-14623-7_13

J. C. Cha and J. H. Cheon, An identity-based signature from Gap Diffie-Hellman groups, Lecture Notes in Computer Science, vol.2567, pp.18-30, 2003.

B. Chevallier-mames, An Efficient CDH-Based Signature Scheme with a Tight Security Reduction, Lecture Notes in Computer Science, vol.3621, pp.511-526, 2005.
DOI : 10.1007/11535218_31

J. Couveignes and J. Kammerer, The geometry of flex tangents to a cubic curve and its parameterizations, Journal of Symbolic Computation, vol.47, issue.3, pp.266-281, 2012.
DOI : 10.1016/j.jsc.2011.11.003
URL : https://hal.archives-ouvertes.fr/hal-01104612

R. R. Farashahi, Hashing into Hessian Curves, AFRICACRYPT, pp.278-289, 2011.
DOI : 10.1006/ffta.1997.0191

R. R. Farashahi, P. Fouque, I. E. Shparlinski, M. Tibouchi, and J. F. Voloch, Indifferentiable deterministic hashing to elliptic and hyperelliptic curves, Mathematics of Computation, vol.82, issue.281, 2012.
DOI : 10.1090/S0025-5718-2012-02606-8

R. R. Farashahi, I. E. Shparlinski, and J. F. Voloch, On hashing into elliptic curves, Journal of Mathematical Cryptology, vol.3, issue.4, pp.353-360, 2010.
DOI : 10.1515/JMC.2009.022

P. Fouque and M. Tibouchi, Deterministic Encoding and Hashing to Odd Hyperelliptic Curves, Pairing, pp.265-277, 2010.
DOI : 10.1007/978-3-642-17455-1_17
URL : https://hal.archives-ouvertes.fr/inria-00556678

P. Fouque and M. Tibouchi, Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves, Lecture Notes in Computer Science, vol.6212, pp.81-91, 2010.
DOI : 10.1007/978-3-642-14712-8_5
URL : https://hal.archives-ouvertes.fr/inria-00556676

M. D. Fried and M. Jarden, Field arithmetic, 2005.
DOI : 10.1007/978-3-662-07216-5

C. Gentry and A. Silverberg, Hierarchical ID-Based Cryptography, Lecture Notes in Computer Science, vol.2501, pp.548-566, 2002.
DOI : 10.1007/3-540-36178-2_34

J. Horwitz and B. Lynn, Toward Hierarchical Identity-Based Encryption, Lecture Notes in Computer Science, vol.2332, pp.466-481, 2002.
DOI : 10.1007/3-540-46035-7_31

T. Icart, How to Hash into Elliptic Curves, Lecture Notes in Computer Science, vol.5677, pp.303-316, 2009.
DOI : 10.1007/978-3-642-03356-8_18

D. P. Jablon, Strong password-only authenticated key exchange, ACM SIGCOMM Computer Communication Review, vol.26, issue.5, pp.5-26, 1996.
DOI : 10.1145/242896.242897

E. J. Kachisa, E. F. Schaefer, and M. Scott, Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field, Pairing, pp.126-135, 2008.
DOI : 10.1007/978-3-540-85538-5_9

J. Kammerer, R. Lercier, and G. Renault, Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time, Pairing, pp.278-297, 2010.
DOI : 10.1007/978-3-642-17455-1_18
URL : https://hal.archives-ouvertes.fr/hal-00694136

L. Kappe and B. Warren, An Elementary Test for the Galois Group of a Quartic Polynomial, The American Mathematical Monthly, vol.96, issue.2, pp.133-137, 1989.
DOI : 10.2307/2323198

B. Libert and J. Quisquater, Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups, Lecture Notes in Computer Science, vol.2947, pp.187-200, 2004.
DOI : 10.1007/978-3-540-24632-9_14

U. M. Maurer, R. Renner, and C. Holenstein, Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology, Lecture Notes in Computer Science, vol.2951, pp.21-39, 2004.
DOI : 10.1007/978-3-540-24638-1_2

G. C. Pereira, M. A. Simplício, J. , M. Naehrig, and P. S. Barreto, A family of implementation-friendly BN elliptic curves, Journal of Systems and Software, vol.84, issue.8, pp.1319-1326, 2011.
DOI : 10.1016/j.jss.2011.03.083

T. Ristenpart, H. Shacham, and T. Shrimpton, Careful with Composition: Limitations of the Indifferentiability Framework, Lecture Notes in Computer Science, vol.6632, pp.487-506, 2011.
DOI : 10.1007/978-3-642-20465-4_27

H. Sato and K. Hakuta, An efficient method of generating rational points on elliptic curves, J. Math-for-Industry, vol.1, issue.A, pp.33-44, 2009.

A. Schinzel and M. Ska-lba, +k in a Finite Field, Bulletin of the Polish Academy of Sciences Mathematics, vol.52, issue.3, pp.223-226, 2004.
DOI : 10.4064/ba52-3-1

A. Shallue and C. Van-de-woestijne, Construction of Rational Points on Elliptic Curves over Finite Fields, ANTS, pp.510-524, 2006.
DOI : 10.1007/11792086_36

M. Ska-lba, Points on elliptic curves over finite fields, Acta Arithmetica, vol.117, issue.3, pp.293-301, 2005.
DOI : 10.4064/aa117-3-7

M. Tibouchi, Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA Introduction in French, 2011.

M. Tibouchi, A note on hasing to BN curves, 2012.

F. Zhang and K. Kim, ID-Based Blind Signature and Ring Signature from Pairings, Lecture Notes in Computer Science, vol.2501, pp.533-547, 2002.
DOI : 10.1007/3-540-36178-2_33