Affine Pairings on ARM, Pairing 2012, pp.203-209, 2012. ,
DOI : 10.1007/978-3-642-36334-4_13
Faster Explicit Formulas for Computing Pairings over Ordinary Curves, EUROCRYPT, pp.48-68, 2011. ,
DOI : 10.1007/978-3-642-20465-4_5
Pairing-Friendly Elliptic Curves of Prime Order, SAC 2005, pp.319-331, 2006. ,
DOI : 10.1007/11693383_22
Computing Small Discrete Logarithms Faster, INDOCRYPT, pp.317-338, 2012. ,
DOI : 10.1007/978-3-642-34931-7_19
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto???Naehrig Curves, Pairing, number 6487 in LNCS, pp.21-39, 2010. ,
DOI : 10.1007/978-3-642-17455-1_2
Hierarchical Identity Based Encryption with Constant Size Ciphertext, LNCS, vol.3494, pp.440-456, 2005. ,
DOI : 10.1007/11426639_26
Evaluating 2-DNF Formulas on Ciphertexts, LNCS, vol.3378, pp.325-341, 2005. ,
DOI : 10.1007/978-3-540-30576-7_18
Finding composite order ordinary elliptic curves using the Cocks???Pinch method, Journal of Number Theory, vol.131, issue.5, pp.832-841, 2011. ,
DOI : 10.1016/j.jnt.2010.05.001
Multiplication and squaring on pairing-friendly fields, Cryptology ePrint Archive Report, p.471, 2006. ,
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups, LNCS, vol.6110, pp.44-61, 2010. ,
DOI : 10.1007/978-3-642-13190-5_3
A Taxonomy of Pairing-Friendly Elliptic Curves, Journal of Cryptology, vol.2, issue.5, pp.224-280, 2010. ,
DOI : 10.1007/s00145-009-9048-z
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions, LNCS, vol.6056, pp.209-223, 2010. ,
DOI : 10.1007/978-3-642-13013-7_13
Improved Cryptanalysis of the Multi-Prime ?? - Hiding Assumption, AFRICACRYPT, pp.92-99, 2011. ,
DOI : 10.1007/BFb0055738
Advances in Elliptic Curve Cryptography, 2005. ,
Instantiability of RSA-OAEP under chosenplaintext attack, CRYPTO, pp.295-313, 2010. ,
Pairing-Based Cryptography at High Security Levels, Cryptography and Coding, pp.13-36, 2005. ,
DOI : 10.1007/11586821_2
Unbelievable Security Matching AES Security Using Public Key Systems, LNCS, vol.2248, pp.67-86, 2001. ,
DOI : 10.1007/3-540-45682-1_5
The development of the number field sieve, Lecture Notes in Mathematics, vol.1554, 1993. ,
DOI : 10.1007/BFb0091534
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting, EUROCRYPT, pp.318-335, 2012. ,
DOI : 10.1007/978-3-642-29011-4_20
Unbounded HIBE and Attribute-Based Encryption, EUROCRYPT, pp.547-567, 2011. ,
DOI : 10.1007/978-3-642-20465-4_30
New Software Speed Records for Cryptographic Pairings, LNCS, vol.6212, pp.109-123, 2010. ,
DOI : 10.1007/978-3-642-14712-8_7
On the (Im)possibility of Projecting Property in Prime-Order Setting, ASIACRYPT, pp.61-79, 2012. ,
DOI : 10.1007/978-3-642-34961-4_6
Optimal Pairings, IEEE Transactions on Information Theory, vol.56, issue.1, pp.455-461, 2010. ,
DOI : 10.1109/TIT.2009.2034881
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions, LNCS, vol.5677, pp.619-636, 2009. ,
DOI : 10.1007/978-3-642-03356-8_36
Acceleration of Composite Order Bilinear Pairing on Graphics Hardware, Information and Communications Security, pp.341-348, 2012. ,
DOI : 10.1007/978-3-642-34129-8_31
Faster Computation of Self-Pairings, IEEE Transactions on Information Theory, vol.58, issue.5, pp.3266-3272, 2012. ,
DOI : 10.1109/TIT.2012.2184850