Hidden pairings and trapdoor DDH groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4076 LNCS, Issue , 2006, Pages 436-451

  Dent, Alexander W ^a   Galbraith, Steven D ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CRYPTOGRAPHY; MULTIVARIABLE CONTROL SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING;

BILINEAR PAIRING; DISCRETE LOGARITHM PROBLEMS; INSTANTIATIONS; MULTIVARIATE EQUATIONS;

SECURITY OF DATA;

EID: 33746690345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11792086_31     Document Type: Conference Paper

References (25)

1. I. Blake, G. Seroussi and N. P. Smart, Advances in elliptic curve cryptography, Cambridge (2005).
2. D. Boneh, B. Lynn, and H Shacham, Short signatures from the Weil pairing, in C. Boyd (ed.), ASIACRYPT 2001, Springer-Verlag LNCS 2248 (2001) 514-532.
3. D. Boneh, Personal communication, July 1, 2005.
4. D. Boneh, E.-J. Goh, and K. Nissim, Evaluating 2-DNF formulas on ciphertexts, in J. Kilian (ed.), TCC 2005, Springer LNCS 3378 (2005) 325-341.
5. R. Cramer and V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack, SIAM Journal on Computing, 33, No. 1 (2004) 167-226.
6. N. Demytko, A new elliptic curve based analogue of RSA, in T. Helleseth (ed.), EUROCRYPT 1993, Springer-Verlag LNCS 765 (1994) 40-49.
7. G. Frey, How to disguise an elliptic curve (Weil descent), Talk at ECC 1998. Slides available from: http://www.cacr.math.uwaterloo.ca/conferences/1998/ecc98/frey.ps
8. G. Frey and H.-G. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Math. Comp., 62, No. 206 (1994) 865-874.
9. S. D. Galbraith and J. F. McKee, Pairings on elliptic curves over finite commutative rings, in N. P. Smart (ed.), Cryptography and Coding: 10th IM A International Conference, Springer-Verlag LNCS 3796 (2005) 392-409.
10. S. D. Galbraith, Disguising tori and elliptic curves, preprint 2006.
11. D. M. Gordon, Designing and detecting trapdoors for discrete log cryptosystems, in E. F. Brickell (ed.), CRYPTO 92, Springer-Verlag LNCS 740 (1993) 66-75.
12. D. Hühnlein, M. J. Jacobson, D. Weber, Towards practical non-interactive public key cryptosystems using non-maximal imaginary quadratic orders, in D. R. Stinson and S. Tavares (eds.), SAC 2000, Springer-Verlag LNCS 2012 (2001) 275-297.
13. A. Joux and K. Nguyen, Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, J. Crypt. 16 (2003) 239-248.
14. 613), posting to the Number Theory Mailing List, 23 Sep 2005.
15. H. W. Lenstra Jr., Factoring integers with elliptic curves, Annals of Mathematics, 126 (1987) 649-673.
16. H. W. Lenstra Jr., Elliptic curves and number theoretic algorithms, Proc. International Congr. Math., Berkeley 1986, AMS (1988) 99-120.
17. A. J. Menezes, T. Okamoto and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Trans. Inf. Theory, 39, No. 5 (1993) 1639-1646.
18. D. Naccache and J. Stern, A new public-key cryptosystem based on higher residues, ACM Conference on Computer and Communications Security (1998) 59-66.
19. T. Okamoto and S. Uchiyama, A new public key cryptosystem as secure as factoring, in K. Nyberg (ed.), EUROCRYPT '98, Springer-Verlag LNCS 1403 (1998) 308-318.
20. P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in J. Stern (ed.), EUROCRYPT 1999, Springer-Verlag LNCS 1592 (1999) 223-238.
21. R. L. Rivest, Homework 4 of course "6.897 Selected Topics in Cryptography", May 2004. http://theory.les.mit.edu/classes/6.897/spring04/hw4.txt
22. E. Teske, An elliptic curve trapdoor scheme, J. Crypt., 19 (2006) 115-133.
23. 607), in C. Boyd (ed.), ASIACRYPT 2001, Springer-Verlag LNCS 2248 (2001) 107-124.
24. E. Thomé, Personal communication, January 9, 2006.
25. n, IEEE Trans. Inf. Theory, Vol. 43, No. 4 (1997) 1231-1237.