Identity-Based Threshold Decryption, pp.262-276 ,
DOI : 10.1007/978-3-540-24632-9_19
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, pp.31-46 ,
DOI : 10.1007/3-540-36288-6_3
Identity-based encryption from the weil pairing, CRYPTO 2001, pp.213-229, 2001. ,
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, pp.416-432, 2003. ,
DOI : 10.1007/3-540-39200-9_26
Short signatures from the weil pairing, ASIACRYPT 2001, pp.514-532, 2001. ,
Elliptic Curve Based Password Authenticated Key Exchange Protocols, ACISP 2001, pp.487-501, 2001. ,
DOI : 10.1007/3-540-47719-5_38
Multipurpose identity-based signcryption (a swiss army knife for identity-based cryptography), CRYPTO 2003, pp.383-399, 2003. ,
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves, CRYPTO 2010, pp.237-254, 2010. ,
DOI : 10.1007/978-3-642-14623-7_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.4859
An identity-based signature from gap diffie-hellman groups, pp.18-30 ,
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves, Mathematics of Computation, vol.82, issue.281, 2010. ,
DOI : 10.1090/S0025-5718-2012-02606-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.193.7713
Constructing pairing-friendly hyperelliptic curves using Weil restriction, Journal of Number Theory, vol.131, issue.5, 2009. ,
DOI : 10.1016/j.jnt.2010.06.003
URL : http://doi.org/10.1016/j.jnt.2010.06.003
Counting Points for Hyperelliptic Curves of Type??y 2=x 5+ax over Finite Prime Fields, SAC 2003, pp.26-41, 2003. ,
DOI : 10.1007/978-3-540-24654-1_3
Hierarchical ID-Based Cryptography, pp.548-566 ,
DOI : 10.1007/3-540-36178-2_34
Suitable curves for genus-4 HCC over prime fields, ICALP 2005, pp.539-550, 2005. ,
Toward Hierarchical Identity-Based Encryption, EUROCRYPT 2002, pp.466-481, 2002. ,
DOI : 10.1007/3-540-46035-7_31
How to Hash into Elliptic Curves, CRYPTO 2009, pp.303-316, 2009. ,
DOI : 10.1007/978-3-642-03356-8_18
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems, ANTS 2002, pp.20-32, 2002. ,
DOI : 10.1007/3-540-45455-1_3
Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time, p.1454, 1005. ,
DOI : 10.1007/978-3-642-17455-1_18
URL : https://hal.archives-ouvertes.fr/hal-00694136
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2???=???x 5???+???ax, Pairing 2008, pp.164-177, 2008. ,
DOI : 10.1007/978-3-540-85538-5_12
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields, ANTS 2000, pp.395-404, 2000. ,
DOI : 10.1007/10722028_24
Efficient signcryption with key privacy from gap diffiehellman groups, pp.187-200 ,
An elementary introduction to hyperelliptic curves Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, vol.3, pp.155-178, 1998. ,
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, EUROCRYPT 2009, pp.536-553, 2010. ,
DOI : 10.1007/BF01272074
Construction of Rational Points on Elliptic Curves over Finite Fields, ANTS 2006, pp.510-524, 2006. ,
DOI : 10.1007/11792086_36
Rational Points on Certain Hyperelliptic Curves over Finite Fields, Bulletin of the Polish Academy of Sciences Mathematics, vol.55, issue.2, pp.97-104, 2007. ,
DOI : 10.4064/ba55-2-1
ID-Based Blind Signature and Ring Signature from Pairings, pp.533-547 ,
DOI : 10.1007/3-540-36178-2_33