Resource-aware conference key establishment for heterogeneous networks

IEEE/ACM Transactions on Networking

Volumn 13, Issue 1, 2005, Pages 134-146

  Trappe, Wade ^a   Wang, Yuke ^b   Liu, K J Ray ^c  

^a RUTGERS UNIVERSITY   (United States)

^b The University of Texas at Dallas   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Conference key agreement; Diffie Hellman; Huffman algorithm

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; OPTIMIZATION; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; TELECOMMUNICATION TRAFFIC;

CONFERENCE KEY AGREEMENT; DIFFIE-HELLMAN PROBLEM; HUFFMAN ALGORITHM;

TELECOMMUNICATION NETWORKS;

EID: 15544371460     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.842236     Document Type: Article

References (33)

1. M. J. Moyer, J. R. Rao, and P. Rohatgi, "A survey of security issues in multicast communications," IEEE Network, vol. 13, no. 6, pp. 12-23, Nov.-Dec. 1999.
2. R. Canetti, J. Garay, G. Itkis, D. Miccianancio, M. Naor, and B. Pinkas, "Multicast security: a taxonomy and some efficient constructions," in Proc. IEEE INFOCOM, 1999, pp. 708-716.
3. C. Wong, M. Gouda, and S. Lam, "Secure group communications using key graphs," IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 16-30, Feb. 2000.
4. D. Balenson, D. McGrew, and A. Sherman, "Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization," Internet Draft Report.
5. S. Banerjee and B. Bhattacharjee, "Scalable secure group communication over IP multicast," IEEE J. Select. Areas Commun. - Special Issue on Network Support for Group Communication, vol. 20, no. 8, pp. 1511-1527, Oct. 2002.
6. W. Trappe, J. Song, R. Poovendran, and K. J. R. Liu, "Key distribution for secure multimedia multicasts via data embedding," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 2001.
7. R. Canetti, T. Malkin, and K. Nissim, "Efficient communication-storage tradeoffs for multicast encryption," Eurocrypt, pp. 456-470, 1999.
8. G. Caronni, M. Waldvogel, D. Sun, and B. Plattner, "Efficient security for large dynamic multicast groups," in 7th Workshop on Enabling Technologies (WET ICE '98), 1998.
9. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. 22, no. 6, pp. 644-654, Nov. 1976.
10. I. Ingemarsson, D. Tang, and C. Wong, "A conference key distribution system," IEEE Trans. Inform. Theory, vol. 28, no. 5, pp. 714-720, Sep. 1982.
11. M. Burmester and Y. Desmedt, "A secure and efficient conference key distribution scheme," Advances in Cryptology - Eurocrypt, pp. 275-286, 1994.
12. M. Steiner, G. Tsudik, and M. Waidner, "Diffie-Hellman key distribution extended to group communication," in Proc. 3rd ACM Conf. Computer Commun. Security, 1996, pp. 31-37.
13. K. Becker and U. Wille, "Communication complexity of group key distribution," in Proc. 5th ACM Conf Computer Communication Security 1998, pp. 1-6.
14. G. Ateniese, M. Steiner, and G. Tsudik, "New multiparty authentication services and key agreement protocols," IEEE J. Select. Areas Commun. vol. 18, no. 4, pp. 628-639, Apr. 2000.
15. V. Miller, "Use of elliptic curves in cryptography," in Advances in Cryptology: Crypto '85, 1986, pp. 417-426.
16. Y. Kim, A. Perrig, and G. Tsudik, "Simple and fault-tolerant key agreement for dynamic collaborative groups," in Proc. 7th ACM Conf. Computer Communication Security, 2000, pp. 235-244.
17. L. R. Dondeti, S. Mukherjee, and A. Samal, "DISEC: a distributed framework for scalable secure many-to-many communication," in Proc. 5th IEEE Symp. Computers and Communications, 2000, pp. 693-698.
18. W. Trappe, Y. Wang, and K. J. R. Liu, "Group key agreement using divide-and-conquer strategies," presented at the The John's Hopkins University Conf. Information Sciences and Systems, Mar. 2001.
19. W. Trappe, Y. Wang, and K. J. R. Liu, "Establishment of conference keys in heterogenous networks," in Proc. IEEE Int. Conf. Communications 2002, pp. 2201-2205.
20. A. Oppenheim and R. Schafer, Discrete-Time Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
21. A. Perrig, R. Szewczyk, D. Tygar, V. Wen, and D. Culler, "SPINS: security protocols for sensor networks," Wireless Networks, vol. 8, no. 5, pp. 521-534, 2002.
22. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
23. D. Huffman, "A method for the construction of minimum redundancy codes," in Proc. Inst. Radio Eng., vol. 40, 1952, pp. 1098-1101.
24. A. Turping and A. Moffat, "Practical length-limited coding for large alphabets," Computer J., vol. 38, pp. 339-347, 1995.
25. L. Larmore and D. Hirschberg, "A fast algorithm for optimal length-limited Huffman codes," J. ACM, vol. 37, pp. 464-473, Jul. 1990.
26. R. Milidiu and E. Laber, "The warm-up algorithm: a Lagrangian construction of length restricted Huffman codes," SIAM J. Computation, vol. 30, pp. 1405-1426, 2000.
27. B. Fox, "Discrete optimization via marginal analysis," Manage. Sci. vol. 13, pp. 210-216, 1966.
28. L. A. Wolsey, Integer Programming. New York: Wiley, 1998.
29. B. Sun, W. Trappe, Y. Sun, and K. J. R. Liu, "A time-efficient contributory key agreement scheme for secure group communication," in Proc. IEEE Int. Conf. Communications, vol. 2, 2002, pp. 1159-1163.
30. A. Law and W. Kelton, Simulation Modeling and Analysis, 2nd ed. New York: McGraw-Hill, 1991.
31. T. Nemetz, "On the word-length of Huffman codes," Probl. Contr. Inform. Theory, vol. 9, pp. 231-242, 1980.
32. E. Gilbert, "Codes based on inaccurate source probabilities," IEEE Trans. Inform. Theory, vol. 17, no. 3, pp. 304-314, May 1971.
33. F. Fabris, A. Sgarro, and R. Pauletti, "Tunstall adaptive coding and miscoding," IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 2167-2180, Nov. 1996.