On computable isomorphisms in efficient asymmetric pairing-based systems

Discrete Applied Mathematics

Volumn 155, Issue 4, 2007, Pages 538-547

  Smart, N P ^a   Vercauteren, F ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Elliptic curve; Pairing based cryptography; Tate pairing

Indexed keywords

CRYPTOGRAPHY; CURVE FITTING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING;

COMPUTABLE ISOMORPHISM; ELLIPTIC CURVE; PAIRING-BASED CRYPTOGRAPHY; PAIRING-BASED SYSTEMS; TATE PAIRING;

COMPUTATION THEORY;

EID: 33845981472     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.004     Document Type: Article

References (7)

1. P.S.L.M. Barreto, B. Lynn, M. Scott, On the selection of pairing-friendly groups, Selected Areas in Cryptography-SAC 2003, Lecture Notes in Computer Science, vol. 3006, Springer, Berlin, 2004, pp. 17-25.
2. D. Boneh, X. Boyen, H. Shacham, Short group signatures, Advances in Cryptology-CRYPTO 2004, Lecture Notes in Computer Science, vol. 3152, Springer, Berlin, 2004, pp. 41-55.
3. Boneh D., and Franklin M. Identity based encryption from the Weil pairing. SIAM J. Comput. 32 (2003) 586-615
4. D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing, Advances in Cryptology-ASIACRYPT 2001, Lecture Notes in Computer Science, vol. 2248, Springer, Berlin, 2001, pp. 514-532.
5. D. Boneh, H. Shacham, Group signatures with verifier-local revocation, 11th ACM Conference on Computer and Communications Security-CCS, 2004, pp. 168-177.
6. Miyaji A., Nakabayashi M., and Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E84-A (2001) 1234-1243
7. Scott M. Faster identity based encryption. Electron. Lett. 40 (2004) 861