Constant-round authenticated group key exchange with logarithmic computation complexity

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

Volumn 4521 LNCS, Issue , 2007, Pages 158-176

  Nam, Junghyun ^a   Paik, Juryon ^b   Kim, Ung Mo ^b   Won, Dongho ^b  

^a Konkuk University   (South Korea)

^b Sungkyunkwan University   (South Korea)

Author keywords

Binary tree; Cryptography; Group key exchange; Nonce chained authentication; Provable security; Scalability

Indexed keywords

AUTHENTICATION; BINARY TREES; CRYPTOGRAPHY; MULTICASTING; NETWORK PROTOCOLS; SCALABILITY;

GROUP KEY EXCHANGE; MULTICAST CHANNELS; NONCE-CHAINED AUTHENTICATION; PROVABLE SECURITY;

ALGORITHMS;

EID: 38049062481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_11     Document Type: Conference Paper

References (42)

1. M. Abdalla, E. Bresson, O. Chevassut, and D. Pointcheval. Password-based group key exchange in a constant number of rounds. 9th International Workshop on Practice and Theory in Public Key Cryptography (PKC '06), LNCS vol. 3958, pp. 427-442, 2006.
2. M. Abdalla, P.-A. Fouque, and D. Pointcheval. Password-based authenticated key exchange in the three-party setting. 8th International Workshop on Practice and Theory in Public Key Cryptography (PKC '05), LNCS vol. 3386, pp. 65-84, 2005.
3. R. Barua, R. Dutta, and P. Sarkar. Extending Joux's protocol to multi party key agreement. Progress in Cryptology - INDOCRYPT '03, LNCS vol. 2904, pp. 205-217, 2003.
4. K. Becker and U. Wille. Communication complexity of group key distribution. 5th ACM Conference on Computer and Communications Security (CCS '98), pp. 1-6, 1998.
5. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. Advances in Cryptology - EUROCRYPT '00, LNCS vol. 1807, pp. 139-155, 2000.
6. M. Bellare and P. Rogaway. Entity authentication and key distribution. Advances in Cryptology - CRYPTO '93, LNCS vol. 773, pp. 232-249, 1993.
7. M. Bellare and P. Rogaway. Provably secure session key distribution - the three party case. 27th ACM Symposium on Theory of Computing (STOC '95), pp. 57-66, 1995.
8. S. Bellovin and M. Merritt. Encrypted key exchange: password-based protocols secure against dictionary attacks. 1992 IEEE Symposium on Security and Privacy, pp. 72-84, 1992.
9. C. Boyd and J. Nieto. Round-optimal contributory conference key agreement. 6th International Workshop on Practice and Theory in Public Key Cryptography (PKC '03), LNCS vol. 2567, pp. 161-174, 2003.
10. E. Bresson, O. Chevassut, and D. Pointcheval. Group Diffie-Hellman key exchange secure against dictionary attacks. Advances in Cryptology - ASIACRYPT '02, LNCS vol. 2501, pp. 497-514, 2002.
11. E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater. Provably authenticated group Diffie-Hellman key exchange. 8th ACM Conference on Computer and Communications Security (CCS '01), pp. 255-264, 2001.
12. M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. Advances in Cryptology - EUROCRYPT '94, LNCS vol. 950, pp. 275-286, 1995.
13. M. Burmester and Y. Desmedt. Efficient and secure conference-key distribution. 1996 International Workshop on Security Protocols, LNCS vol. 1189, pp. 119-129, 1997.
14. R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. Advances in Cryptology - EUROCRYPT '01, LNCS vol. 2045, pp. 453-474, 2001.
15. R. Canetti and H. Krawczyk. Universally composable notions of key exchange and secure channels. Advances in Cryptology - EUROCRYPT '02, LNCS vol. 2332, pp. 337-351, 2002.
16. K.-K. R. Choo. Provably-secure mutual authentication and key establishment protocols lounge. 2006. Available at http://sky.fit.qut.edu.au/ ~choo/lounge.html.
17. K.-K. Choo, C. Boyd, and Y. Hitchcock. Errors in computational complexity proofs for protocols. Advances in Cryptology - ASIACRYPT '05, LNCS vol. 3788, pp. 624-643, 2005.
18. D. Denning and G. Sacco. Timestamps in key distribution protocols. Communications of the ACM, vol. 24, no. 8, pp. 533-536, 1981.
19. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
20. W. Diffie, P. Oorschot, and M. Wiener. Authentication and authenticated key exchanges. Designs, Codes, and Cryptography, vol. 2, no. 2, pp. 107-125, 1992.
21. R. Dutta and R. Barua. Constant round dynamic group key agreement. 8th International Conference on Information Security (ISC '05), LNCS vol. 3650, pp. 74-88, 2005.
22. R. Dutta, R. Barua, and P. Sarkar. Provably secure authenticated tree based group key agreement. 6th International Conference on Information and Communications Security (ICICS '04), LNCS vol. 3269, pp. 92-104, 2004.
23. S. Hirose and S. Yoshida. An authenticated Diffie-Hellman key agreement protocol secure against active attacks. 1st International Workshop on Practice and Theory in Public Key Cryptography (PKC '98), LNCS vol. 1431, pp. 135-148, 1998.
24. I. Ingemarsson, D. Tang, and C. Wong. A conference key distribution system. IEEE Transactions on Information Theory, vol. 28, no. 5, pp. 714-720, 1982.
25. A. Joux. A one round protocol for tripartite Diffie-Hellman. Journal of Cryptology, vol. 17, no. 4, pp. 263-276, 2003. A preliminary version was presented at ANTS IV.
26. B. Jung, S. Paeng, and D. Kim. Attacks to Xu-Tilborg's conference key distribution scheme. IEEE Communications Letters, vol. 8, no. 7, pp. 446-448, 2004.
27. J. Katz, R. Ostrovsky, and M. Yung. Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology - EUROCRYPT '01, LNCS vol. 2045, pp. 475-494, 2001.
28. J. Katz and J. Shin. Modeling insider attacks on group key-exchange protocols. 12th ACM Conference on Computer and Communications Security (CCS '05), pp. 180-189, 2005.
29. J. Katz and M. Yung. Scalable protocols for authenticated group key exchange. Advances in Cryptology - CRYPTO '03, LNCS vol. 2729, pp. 110-125, 2003.
30. H.-J. Kim, S.-M. Lee, and D. Lee. Constant-round authenticated group key exchange for dynamic groups. Advances in Cryptology - ASIACRYPT '04, LNCS vol. 3329, pp. 245-259, 2004.
31. Y. Kim, A. Perrig, and G. Tsudik. Simple and fault-tolerant key agreement for dynamic collaborative groups. 7th ACM Conference on Computer and Communications Security (CCS '00), pp. 235-244, 2000.
32. Y. Kim, A. Perrig, and G. Tsudik. Communication-efficient group key agreement. IFIP SEC '01, pp. 229-244, 2001.
33. H. Krawczyk. HMQV: a high-performance secure Diffie-Hellman protocol. Advances in Cryptology - CRYPTO '05, LNCS vol. 3621, pp. 546-566, 2005.
34. S. Lee, Y. Kim, K. Kim, and D.-H. Ryu. An efficient tree-based group key agreement using bilinear map. 1st International Conference on Applied Cryptography and Network Security (ACNS '03), LNCS vol. 2846, pp. 357-371, 2003.
35. M. Mayer and M. Yung. Secure protocol transformation via "Expansion": From two-party to groups. 6th ACM Conference on Computer and Communications Security (CCS '99), pp. 83-92, 1999.
36. J. Nam, J. Lee, S. Kim, and D. Won. DDH-based group key agreement in a mobile environment. Journal of Systems and Software, vol. 78, no. 1, pp. 73-83, 2005.
37. E. Okamoto and K. Tanaka. Key distribution system based on identification information. IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, pp. 481-485, 1989.
38. K. Ren, H. Lee, K. Kim, and T. Yoo. Efficient authenticated key agreement protocol for dynamic groups. 5th International Workshop on Information Security Applications (WISA '04), LNCS vol. 3325, pp. 144-159, 2004.
39. A. Sherman and D. McGrew. Key establishment in large dynamic groups using one-way function trees. IEEE Transactions on Software Engineering, vol. 29, no. 5, pp. 444-458, 2003.
40. V. Shoup. On formal models for secure key exchange. Cryptology ePrint Archive, Report 1999/012, 1999. Available at http://eprint.iacr.org/.
41. D. Wallner, E. Harder, and R. Agee. Key management for multicast: issues and architectures. RFC 2627, 1999.
42. C. Wong, M. Gouda, and S. Lam. Secure group communications using key graphs. IEEE/ACM Transactions on Networking, vol. 8, no. 1, pp. 16-30, 2000. A preliminary version was presented at ACM SIGCOMM '98.