Dynamic group diffie-hellman key exchange under standard assumptions

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

Volumn 2332, Issue , 2002, Pages 321-336

  Bresson, Emmanuel ^a   Chevassut, Olivier ^b,c   Pointcheval, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CRYPTOGRAPHIC PROBLEMS; DECISIONAL DIFFIE HELLMAN ASSUMPTION; DIFFIE-HELLMAN KEY EXCHANGE; FORMAL SECURITY MODELS; NATURAL EXTENSION; RANDOM ORACLE MODEL; STANDARD ASSUMPTIONS; THE STANDARD MODEL;

SECURITY OF DATA;

EID: 50849092893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_21     Document Type: Conference Paper

References (29)

1. G. Ateniese, M. Steiner, and G. Tsudik. Authenticated group key agreement and friends. In ACM CCS ’98, pp. 17–26. 1998.
2. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Proc. of Crypto ’96, LNCS 1109, pp. 1–15. Springer, 1996.
3. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Proc. of Eurocrypt ’00, LNCS 1807, pp. 139–155. Springer, 2000.
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In ACM CCS ’93, pp. 62–73. 1993.
5. K. P. Birman. A review experience with reliable multicast. Software – Practice and Experience, 29(9):741–774, 1999.
6. D. Boneh. The decision Diffie-Hellman problem. In Proc. of ANTS III, LNCS 1423, pp. 48–63. Springer, 1998.
7. E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater. Provably authenticated group Diffie-Hellman key exchange. In ACM CCS ’01, pp. 255–264. 2001.
8. E. Bresson, O. Chevassut, and D. Pointcheval. Provably authenticated group Diffie-Hellman key exchange – the dynamic case. In Proc. of Asiacrypt ’01, LNCS 2248, pp. 290–309. Springer, 2001.
9. E. Bresson, O. Chevassut, and D. Pointcheval. Dynamic group Diffie-Hellman key exchange under standard assumptions. In Proc. of Eurocrypt ’02, LNCS. Springer, 2002. Full version of this paper available at http://www.di.ens.fr/∼pointche.
10. M. Burmester and Y. G. Desmedt. A secure and efficient conference key distribution system. In Proc. of Eurocrypt ’94, LNCS 950, pp. 275–286. Springer, 1995.
11. G. V. Chockler, I. Keidar, and R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys, 33(4):1–43, 2001.
12. G. Di Crescenzo, N. Ferguson, R. Impagliazzo, and M. Jakobsson. How to forget a secret. In Proc. of STACS ’99, LNCS 1563, pp. 500–509. Springer, 1999.
13. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, 1976.
14. W. Diffie, D. Steer, L. Strawczynski, and M. Wiener. A secure audio teleconference system. In Proc. of Crypto ’88, LNCS 403, pp. 520–528. Springer, 1988.
15. W. Diffie, P. van Oorschot, and W. Wiener. Authentication and authenticated key exchange. In Designs, Codes and Cryptography, vol. 2(2), pp. 107–125, 1992.
16. C. G. Gunter. An identity-based key exchange protocol. In Proc. of Eurocrypt ’89, LNCS 434, pp. 29–37. Springer, 1989.
17. 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.
18. M. Joye and J.-J. Quisquater. On the importance of securing your bins: The garbage-man-in-the-middle attack. In ACM CCS’97, pp. 135–141. 1997.
19. M. Just and S. Vaudenay. Authenticated multi-party key agreement. In Proc. Of Asiacrypt ’96, LNCS 1163, pp. 36–49. Springer, 1996.
20. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudorandom functions. In FOCS ’97, pp. 458–467. IEEE, 1997.
21. NIST. FIPS 140-1: Security Requirements for Cryptographic Modules. U. S. N ational Institute of Standards and Technology, 1994.
22. E. R. Palmer, S. W. Smith, and S. Weingart. Using a high-performance, programmable secure coprocessor. In Financial Crypto ’98, LNCS 1465, pp. 73–89. Springer, 1998.
23. A. Rubin and V. Shoup. Session-key disribution using smart cards. In Proc. Of Eurocrypt ’96, LNCS 1070, pp. 321–331. Springer, 1996.
24. V. Shoup. On formal models for secure key exchange. Technical Report RZ 3120, IBM Z¨urich Research Lab, 1999.
25. V. Shoup. OAEP reconsidered. In J. Kilian, editor, Proc. of Cryto’ 01, volume 2139 of LNCS, pages 239–259. Springer-Verlag, 2001.
26. M. Steiner, G. Tsudik, and M. Waidner. Diffie-Hellman key distribution extended to group communication. In ACM CCS ’96, pp. 31–37. 1996.
27. W. G. Tzeng. A practical and secure fault-tolerant conference-key agreement protocol. In Proc. of PKC ’00, LNCS 1751, pp. 1–13. Springer, 2000.
28. K. Vedder and F. Weikmann. Smart cards requirements, properties, and applications. In State of the Art in Applied Cryptography, LNCS 1528. Springer, 1997.
29. S. H. Weingart. Physical security devices for computer subsystems: A survey of attacks and defenses. In Proc. of CHES ’00, LNCS 1965, pp. 302–317. Springer, 2000.