A key-chain-based keying scheme for many-to-many secure group communication

ACM Transactions on Information and System Security

Volumn 7, Issue 4, 2004, Pages 523-552

  Huang, Dijiang ^a   Medhi, Deep ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Hash chain; Key chain; Many to many secure group communication; Secure group communication

Indexed keywords

HASH CHAINS; KEY CHAIN; MANY-TO-MANY SECURE GROUP COMMUNICATION; SECURE GROUP COMMUNICATION;

DATA PRIVACY; DELAY CONTROL SYSTEMS; LINEAR CONTROL SYSTEMS; NETWORK PROTOCOLS; REAL TIME SYSTEMS; TELECONFERENCING; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMUNICATION SYSTEMS;

EID: 14544302192     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042031.1042033     Document Type: Article

References (46)

1. ALVES-FOSS, J. 2000. An efficient secure authenticated group key exchange algorithm for large and dynamic groups. In Proceedings 23rd National Information Systems Security Conference (NISSC). National Institute of Standards and Technology, National Computer Security Center, Baltimore, MD, USA, 254-266.
2. ATENIESE, G., STEINER, M., AND TSUDIK, G. 1998. Authenticated group key agreement and friends. In Proceedings of the 5th ACM Conference on Computer and Communications Security. ACM Press New York, NY, USA, San Francisco, California, 17-26.
3. BALLARDIE, T. 1996. Scalable multicast key distribution. RFC 1949.
4. BERKOVITS, S. 1992. How to broadcast a secret. In Advances in Cryptology: EUROCRPT '91. Lecture Notes in Computer Science, vol. 547. Springer-Verlag, Berlin, 536-541.
5. BLOM, R. 1985. An optimal class of symmetric key generation systems. In EUROCRYPT84. Lecture Notes in Computer Science, vol. 209. Springer-Verlag, Paris, France, 335-338.
6. BLUNDO, C. AND CRESTI, A. 1995. Space requirements for broadcast encryption. In Advances in Cryptology: EUROCRYPT '94. Lecture Notes in Computer Science. Springer-Verlag, New York, 287-298.
7. BLUNDO, C., MATTOS, L. A. F., AND STINSON, D. R. 1994. Multiple key distribution maintaining user anonymity via broadcast channels. J. Comput. Secur. 3, 4, 309-323.
8. BLUNDO, C., MATTOS, L. A. F., AND STINSON, D. R. 1996. Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution. In Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag, Santa Barbara, California, USA, 387-400.
9. BLUNDO, C., SANTIS, A. D., HERZBERG, A., KUTTEN, S., VACCARO, U., AND YUNG, M. 1993. Perfectly-secure key distribution for dynamic conferences. Lecture Notes in Computer Science, vol. 740. Springer-Verlag, Berlin, 471-486.
10. BLUNDO, C., SANTIS, A. D., HERZBERG, A., KUTTEN, S., VACCARO, U., AND YUNG, M. 1998. Perfectly-secure key distribution for dynamic conferences. Inform. Comput. 146, 1, 1-23.
11. BLUNDO, C., SANTIS, A. D., AND VACCARO, U. 1996. Randomness in distribution protocols. Informat. Comput. 131, 2, 111-139.
12. BRISCOE, B. 1999. Marks: Zero side effect multicast key management using arbitrarily revealed key. In Networked Group Communication (NGC'99). Springer-Verlag, Pisa, Italy.
13. BURMESTER, M. AND DESMEDT, Y. 1995. A secure and efficient conference key distribution system. In Proceedings of Eurocrypt' 94. Lecture Notes in Computer Science, vol. 950. Springer-Verlag, Berlin, 275-286.
14. BURMESTER, M. AND DESMEDT, Y. 1996. Efficient and secure conference-key distribution. In Security Protocols Workshop. Springer-Verlag, Cambridge, UK, 119-129.
15. COMTET, L. 1974. Advanced Combinatorics: The Art of Finite and Infinite Expansions. Dordrecht, Boston, D. Reidel Publishing, Co., Netherlands.
16. COPPERSMITH, D. AND JAKOBSSON, M. 2002. Almost optimal hash sequence traversal. In Finacial Cryptography. InterVarsity Press, Southampton, Bermuda.
17. DONDETI, L. R., MUKHERJEE, S., AND SAMAL, A. 1999. Survey and Comparison of Secure Group Communication Protocols. Tech. rep., University of Nebraska, Lincoln.
18. DONDETI, L. R., MUKHERJEE, S., AND SAMAL, A. 2000. A distributed framework for scalable secure many-to-many communication. In Fifth IEEE Symposium on Computers and Communications. Antibes-Juan les Pins, France.
19. FIAT, A. AND NAOR, M. 1994. Broadcast encryption. In CRYPTO'93. Lecture Notes in Computer Science, vol. 773. Springer-Verlag, Santa Barbara, California, 480-491.
20. GONG, L. AND SHACHAM, N. 1994. Elements of trusted multicasting. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia. 176-183.
21. GONG, L. AND WHEELER, D. I. 1990. A matrix key-distribution scheme. J. Cryptol. 2, 1, 51-59.
22. HARARY, F. 1969. Graph Theory. Addison-Wesley Publishing Company, Inc.
23. HARNEY, H. AND MUCKENHIRN, C. 1997. Group key management protocol (GKMP) architecture. RFC 2094.
24. JAKOBSSON, M. 2002. Fractal hash sequence representation and traversal. In IEEE International Symposium on Information Theory.
25. JUST, M., KRANAKIS, E., KRIZANC, D., AND VAN OORSCHOT, P. 1994. On key distribution via true broadcasting. In Proceedings of the 2nd ACM Conference on Computer and Communications Security. 81-88.
26. KIM, Y., PERRIG, A., AND TSUDIK, G. 2000. Simple and fault-tolerant key agreement for dynamic collaborative groups. In ACM Conference on Computer and Communications Security. 235-244.
27. KIM, Y., PERRIG, A., AND TSUDIK, G. 2001. Communication-efficient group key agreement. Tech. rep., Department of Information and Computer Science, University of California, Irvine.
28. KORJIK, V., IVKOV, M., MERINOVICH, Y., BARG, A., AND VAN TILBORG, H. C. A. 1995. A broadcast key distribution scheme based on block designs. In IMA Conference. 2-12.
29. KUROSAWA, K., OKADA, K., AND SAKANO, K. 1995. Security of the center in key distribution schemes. In Advances in Cryptology: ASIACRYPT '94. Lecture Notes in Computer Science.
30. LEIGHTON, T. AND MICALI, S. 1994. Secret-key agreement without public-key cryptography. Advances in Cryptology: CRYPTO '93. Lecture Notes in Computer Science, vol. 773. 456-479.
31. MITTRA, S. 1997. A framework for scalable secure multicasting. In ACM SIGCOMM. 277-288.
32. MOYER, M. J., RAO, J. R., AND ROHATGGI, P. 1999. A survey of security issues in multicast communications. lEEE Netw. 13, 6, 12-23.
33. NAOR, D., NAOR, M., AND LOTSPIECH, J. 2001. Revocation and tracing schemes for stateless receivers. In Lecture Notes in Computer Science, vol. 2139. 41-62.
34. NIST. 1995. Secure Hash Standard. FIPS PUB 180-1.
35. RAFAELI, S. AND HUTCHISON, D. 2003. A survey of key management for secure group comunication. ACM Comput. Surv. 35, 3, 309-329.
36. RIVEST, R. L. 1992. The MD5 message-digest algorithm. RFC 1321.
37. SHERMAN, A. T. AND MCGREW, D. A. 2003. Key establishment in large dynamic groups using one-way function trees. IEEE Trans. Softw. Engng 29, 5, 444-458.
38. SKIENA, S. 1990. Implementing Discrete Mathematics. Addison-Wesley Publishing Company.
39. SNOEYINK, J., SURI, S., AND VARGHESE, G. 2001. A lower bound for multicast key distribution. In IEEE INFOCOM 1, 22-26.
40. STEINER, M., TSUDIK, G., AND WAIDNER, M. 1996. Diffie-Hellman key distribution extended to group communication. In ACM Conference on Computer and Communications Security. 31-37.
41. STEINER, M., TSUDIK, G., AND WAIDNER, M. 1998. CLIQUES: A new approach to group key agreement. In Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98). IEEE Computer Society Press, Amsterdam, 380-387.
42. STINSON, D. R. 1997. On some methods for unconditionally secure key distribution and broadcast encryption. Des. Codes Cryptogr. 12, 3, 215-243.
43. STINSON, D. R. AND VAN TRUNG, T. 1998. Some new results on key distribution patterns and broadcast encryption. Des. Codes Cryptogr. 14, 3, 261-279.
44. WALDVOGEL, M., CARONNI, G., SUN, D., WEILER, N., AND PLATTNER, B. 1999. The versakey framework: Versatile group key management. IEEE J. Sel. Areas Commun. 17, 9, 1614-1631.
45. WALLNER, D. M., HARDER, E. J., AND AGEE, R. C. 1999. Key management for multicast: Issues and architectures. RFC 2627.
46. WONG, C. K., GOUDA, M., AND LAM, S. S. 2000. Secure group communications using key graphs. IEEE/ACM Trans. Netw. 8, 1, 16-30.