The twist-AUgmented technique for key exchange

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

Volumn 3958 LNCS, Issue , 2006, Pages 410-426

  Chevassut, Olivier ^a   Fouque, Pierre Alain ^b   Gaudry, Pierrick ^c   Pointcheval, David ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; RANDOM NUMBER GENERATION; SECURITY OF DATA; STANDARDIZATION;

DIFFIE-HELLMAN KEY EXCHANGE; PSEUDO-RANDOM FUNCTIONS (PRF); RANDOMNESS EXTRACTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33745812321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_27     Document Type: Conference Paper

References (35)

1. M. Abdalla, M. Bellare, and P. Rogaway. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. In CT - RSA '01, LNCS 2020, pages 143-158. Springer-Verlag, 2001.
2. B. Barak and S. Halevi. An architecture for robust pseudo-random generation and applications to /dev/random. In Proc. of ACM CCS, ACM, 2005.
3. B. Barak, R. Shaltiel and E. Tromer. True Random Number Generators Secure in a Changing Environment. In CHES '03, pages 166-180. LNCS 2779, 2003.
4. S. M. Bellovin and M. Merritt. Encrypted Key Exchange: Password-Based Protocols Secure against Dictionary Attacks. In Proc. of the Symposium on Security and Privacy, pages 72-84. IEEE, 1992.
5. M. Bellare, R. Canetti and H. Krawczyk. Keying Hash Functions for Message Authentication. In Crypto '96, LNCS 1109, pages 1-15. Springer-Verlag, 1996.
6. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of ACM CCS, pages 62-73. ACM Press, 1993.
7. B. Möller. A Public-Key Encryption Scheme with Pseudo-Random Ciphertexts. In ESORICS '04, LNCS 3193, pages 335-351. Springer-Verlag, Berlin, 2004.
8. C. Boyd, P. Montague, and K. Nguyen. Elliptic Curve Based Password Authenticated Key Exchange Protocols. In ACISP '01, LNCS 2119, pages 487-501. Springer-Verlag, 2001.
9. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz and A. Sahai. Exposure-Resilient Functions and All-Or-Nothing Transforms. In Eurocrypt '00, LNCS 1807, pages 453-469. Springer-Verlag, 2000.
10. O. Chevassut, P. A. Fouque, P. Gaudry, and D. Pointcheval. Key Derivation and Randomness Extraction. ePrint Report 2005/061. Available at http://eprint.iacr.org/.
11. O. Chevassut, P. A. Fouque, P. Gaudry, and D. Pointcheval. The Twist-Augmented Technique for Key Exchange. Full version available at http://www.di.ens.fr/users/pointche/pub.php.
12. Q. Dang and T. Polk. Hash-Based Key Derivation, draft-dang-nistkdf-00.txt. Available at http://www.ietf.org/internet-drafts/.
13. W. Dime and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
14. Y. Dodis. Exposure-Resilient Cryptography. PhD Thesis, MIT, August 2000.
15. Y. Dodis, R. Gennaro, J. Håstad, H. Krawezyk, and T. Rabin. Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. In Crypto '04, LNCS, pages 494-510. Springer-Verlag, 2004.
16. Y. Dodis, A. Sahai, A. Smith. On perfect and adaptive security in exposure-resilient cryptography. In Eurocrypt '01, LNCS 2405, pages 301-324. Springer-Verlag, 2001.
17. R. Gennaro, H. Krawezyk, and T. Rabin. Secure Hashed Diffie-Hellman over Non-DDH Groups. In Eurocrypt '04, LNCS 3027, pages 361-381. Springer-Verlag, 2004.
18. D. Harkins and D. Carrel. The Internet Key Exchange (IKE). RFC 2409, 1998.
19. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A Pseudorandom Generator from any One-Way Function. SIAM Journal of Computing, 28(4): 1364 1396, 1999.
20. I. Impagliazzo, L. Levin, and M. Luby. Pseudo-Random Generation from One-Way Functions. In Proc. of the 21st STOC, pages 12-24. ACM Press, New York, 1989.
21. I. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In Proc. of the 30th Annual IEEE FOCS, pages 248-253, 1989.
22. B. Kaliski. One-Way Permutations on Elliptic Curves. Journal of Cryptology, 3(3):187-199, 1991.
23. J. Kamp and D. Zuckerman. Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
24. C. Kaufman. The Internet Key Exchange (IKEv2) Protocol. INTERNET-DRAFT draft-ietf-ipsec-ikev2-17.txt, September 23, 2004. Available at http://www.ietf.org/internet-drafts/draft-ietf-ipsec-ikev2-17.txt
25. P. L. Montgomery. An FFT Extension of the Elliptic Curve Method of Factorization. PhD thesis, University of California - Los Angeles, 1992.
26. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. In J. of Computer and System Sciences, 63:612-626, 1986.
27. R. Schoof. Counting Points on Elliptic Curves over Finite Fields. In J. Théor. Nombres Bordeaux, 7:219-254, 1995.
28. R. Shaltiel. Recent developments in Extractors. In Bulletin of the European Association for Theoretical Computer Science, Volume 77, June 2002, pages 67-95. Available at http://www.wisdom.weizmann.ac.il/~ronens/papers/survey.ps, 2002.
29. V. Shoup. A Proposal for an ISO Standard for Public-Key Encryption, december 2001. ISO/IEC JTC 1/SC27.
30. V. Shoup. OAEP Reconsidered. In Crypto '01, LNCS 2139, pages 239-259. Springer-Verlag, Berlin, 2001.
31. V. Shoup. A Computational Introduction to Number Theory Algebra. In Cambridge University Press, 2005. Freely available at http://www.shoup.net/ntb/.
32. V. Shoup. Sequences of Games: A Tool for Taming Complexity in Security Proofs. Available at http://www.shoup.net/papers/, 2004.
33. J. H. Silverman. The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, 1986.
34. T. Dierks and C. Allen. The TLS Protocol Version 1.0. RFC 2246, January 1999. OpenSSL. version 0.9.7e
35. L. Trevisan and S. Vadhan. Extracting Randomness from Samplable Distributions. In Proc. of the 41st Annual IEEE FOCS, 2000.