The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2013 vol.62)
pp: 1656-1672
Jing Liu , Sun Yat-Sen University, Guangzhou
Qiong Huang , South China Agricultural University, Guangzhou
Bo Yang , Shaanxi Normal University, Xi'an
Yang Zhang , Sun Yat-Sen University, Guangzhou
ABSTRACT
When assigning personal keys, stateful multicast key distribution (MKD) protocols usually rely on some type of dynamic group access structure which helps achieve a better tradeoff among storage, communication, and computation overheads. However, there exist some stateful MKD protocols whose personal key assignments are based on two static group access structures called Dual Hash Chain (DHC) and Binary Hash Tree (BHT). We introduce two new types of group access structures called Dual Homomorphic One-way Function Chain (D-HOFC) and Top-Down Homomorphic One-way Function Tree (TD-HOFT). Both can be regarded as dynamic counterparts of DHC and BHT, respectively. Our research motivation is to investigate what benefits these two new dynamic structures will bring for MKD protocols compared with their static counterparts. Using D-HOFC, we propose a time-based MKD protocol that counters the rejoining member attack on a DHC-based protocol, and a stateful user-based MKD protocol that has a lower computational overhead for Group Controller (GC) than the DHC-based protocol. Using TD-HOFT, we design a stateful user-based MKD protocol that outperforms the original EKT protocol. Performance comparisons and experiment results show that our protocols based on dynamic structures have their own advantages compared with those based on the corresponding static counterparts.
INDEX TERMS
Protocols, Cryptography, Receivers, Heuristic algorithms, Educational institutions, Computational efficiency, homomorphic one-way permutation (HOWP), Multicast key distribution, group access structure
CITATION
Jing Liu, Qiong Huang, Bo Yang, Yang Zhang, "Efficient Multicast Key Distribution Using HOWP-Based Dynamic Group Access Structures", IEEE Transactions on Computers, vol.62, no. 8, pp. 1656-1672, Aug. 2013, doi:10.1109/TC.2012.245
REFERENCES
[1] A.T. Sherman and D.A. McGrew, "Key Establishment in Large Dynamic Groups Using One-Way Function Trees," IEEE Trans. Software Eng., vol. 29, no. 5, pp. 444-458, May 2003.
[2] M. Steiner, G. Tsudik, and M. Waidner, "Key Agreement in Dynamic Peer Groups," IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, Aug. 2000.
[3] Y. Kim, A. Perrig, and G. Tsudik, "Tree-Based Group Key Agreement," ACM Trans. Information and System Security, vol. 7, no. 1, pp. 60-96, 2004.
[4] S. Rafaeli and D. Hutchison, "A Survey of Key Management for Secure Group Communication," ACM Computing Surveys, vol. 35, no. 3, pp. 309-329, 2003.
[5] Y. Challal and H. Seba, "Group Key Management Protocols: A Novel Taxonomy," Int'l J. Information Technology, vol. 2, no. 2, pp. 105-118, 2005.
[6] S. Zhu and S. Jajodia, "Scalable Group Key Management for Secure Multicast: A Taxonomy and New Directions," Network Security, S.C.H. Huang, D. MacCallum, and D.-Z. Du, eds., pp. 57-75, Springer, 2010.
[7] C.K. Wong, M. Gouda, and S.S. Lam, "Secure Group Communications Using Key Graphs," IEEE-ACM Trans. Networking, vol. 8, no. 1, pp. 16-30, Feb. 2000.
[8] D.M. Wallner, E.J. Harder, and R.C. Agee, "Key Management for Multicast: Issues and Architectures," Internet Draft, Internet Eng. Task Force, 1998.
[9] G. Caronni, K. Waldvogel, D. Sun, and B. Plattner, "Efficient Security for Large and Dynamic Multicast Groups," Proc. IEEE Seventh Int'l Workshops Enabling Technologies: Infrastructure for Collaborative Enterprises, pp. 376-383, 1998.
[10] R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast Security: A Taxonomy and Some Efficient Constructions," Proc. IEEE INFOCOM, pp. 708-716, 1999.
[11] A. Perrig, D. Song, and D. Tygar, "ELK, a New Protocol for Efficient Large-Group Key Distribution," Proc. IEEE Symp. Security and Privacy, pp. 247-262, 2001.
[12] M. Waldvogel, G. Caronni, S. Dan, N. Weiler, and B. Plattner, "The VersaKey Framework: Versatile Group Key Management," IEEE J. Selected Areas in Comm., vol. 17, no. 9, pp. 1614-1631, Sept. 1999.
[13] D. Naor, M. Naor, and J.B. Lotspiech, "Revocation and Tracing Schemes for Stateless Receivers," Proc. 21st Ann. Int'l Cryptology Conf. Advances in Cryptology, pp. 41-62, 2001.
[14] D. Halevy and A. Shamir, "The LSD Broadcast Encryption Scheme," Proc. 22nd Ann. Int'l Cryptology Conf. Advances in Cryptology, pp. 47-60, 2002.
[15] R.S. Douglas, Cryptography Theory and Practice, third ed. CRC Press, 2005.
[16] L. Cheung, J.A. Cooley, R. Khazan, and C. Newport, "Collusion-Resistant Group Key Management Using Attribute-Based Encryption," Cryptology ePrint Archive Report, 2007/161, 2007.
[17] Z. Zhou and D. Huang, "On Efficient Ciphertext-Policy Attribute Based Encryption and Broadcast Encryption," Proc. 17th ACM Conf. Computer and Comm. Security, pp. 753-755, 2010.
[18] S. Berkovits, "How to Broadcast a Secret," Proc. 10th Ann. Int'l Cryptology Conf. Advances in Cryptology, pp. 535-541, 1991.
[19] M. Naor and B. Pinkas, "Efficient Trace and Revoke Schemes," Proc. Fourth Int'l Conf. Financial Cryptography, Y. Frankel, ed., pp. 1-20, 2001.
[20] L. Harn and L. Changlu, "Authenticated Group Key Transfer Protocol Based on Secret Sharing," IEEE Trans. Computers, vol. 59, no. 6, pp. 842-846, June 2010.
[21] G.H. Chiou and W.T. Chen, "Secure Broadcasting Using the Secure Lock," IEEE Trans. Software Eng., vol. 15, no. 8, pp. 929-934, Aug. 1989.
[22] D. Micciancio and S. Panjwani, "Corrupting one vs. Corrupting Many: The Case of Broadcast and Multicast Encryption," Proc. Int'l Colloquium Automata, Languages and Programming, pp. 70-82, 2006.
[23] J. Liu and C.J. Wang, "Exclusive Key Based Group Rekeying," Cryptology ePrint Archive, Report 2011/575, 2011.
[24] B. Briscoe, "MARKS: Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences," Proc. First Int'l Workshop Networked Group Comm., pp. 301-320, 1999.
[25] J. Liu and B. Yang, "Collusion-Resistant Multicast Key Distribution Based on Homomorphic One-Way Function Trees," IEEE Trans. Information Forensics and Security, vol. 6, no. 3, pp. 980-991, Sept. 2011.
[26] I. Chang, R. Engel, D. Kandlur, D. Pendarakis, and D. Saha, "Key Management for Secure Lnternet Multicast Using Boolean Function Minimization Techniques," Proc. IEEE INFOCOM, pp. 689-698, 1999.
[27] Z. Zhou and D. Huang, "An Optimal Key Distribution Scheme for Secure Multicast Group Communication," Proc. IEEE INFOCOM, pp. 1-5, 2010.
[28] J. Fan, P. Judge, and M.H. Ammar, "HySOR: Group Key Management with Collusion-Scalability Tradeoffs Using a Hybrid Structuring of Receivers," Proc. 11th Int'l Conf. Computer Comm. and Networks, pp. 196-201, 2002.
[29] H. Kim, S.M. Hong, H. Yoon, and J.W. Cho, "Secure Group Communication with Multiplicative One-Way Functions," Proc. Int'l Conf. Information Technology: Coding and Computing, vol. 1, pp. 685-690, 2005.
[30] B. Briscoe and I. Fairman, "Nark: Receiver-Based Multicast Non-Repudiation and Key Management," Proc. First ACM Conf. Electronic Commerce, pp. 22-30 , 1999.
[31] A. Fiat and M. Naor, "Broadcast Encryption," Proc. Int'l Cryptology Conf. Advances in Cryptology, pp. 480-490, 1994.
[32] M.O. Rabin, "Digitalized Signatures and Public-Key Functions as Intractable as Factorization," Research Report, Lab. for Computer Science, Cambridge: Massachusetts Inst. of Tech nology, 1979.
[33] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
[34] J. Staddon, S. Miner, M. Franklin, D. Balfanz, M. Malkin, and D. Dean, "Self-Healing Key Distribution with Revocation," Proc. IEEE Symp. Security and Privacy, pp. 241-257, 2002.
[35] S. Panjwani, "Private Group Communication: Two Perspectives and a Unifying Solution," PhD thesis, Computer Science and Eng. Dept., Univ. of California, San Diego, 2007.
[36] S.S. Ltd, "MIRACL (Multiprecision Integer and Rational Arithmetic C/C ++Library)," http:/www.shamus.ie/, Nov. 2011.
[37] NIST, Secure Hash Standard, Fed. Information Processing Standard FIPS-180-1,, Apr. 1995.
[38] X.Y. Wang and H.B. Yu, "How to Break MD5 and Other Hash Functions," Proc. 24th Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques, pp. 19-35, 2005.
[39] X.Y. Wang, Y.L. Yin, and H.B. Yu, "Finding Collisions in the Full SHA-1," Proc. 25th Ann. Int'l Conf. Advances in Cryptology, pp. 17-36, 2005.
[40] R. Rivest, "The MD5 Message-Digest Algorithm," RFC 1321, Apr. 1992.
[41] K.C. Almeroth and M.H. Ammar, "Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone," Proc. IEEE Fifth Int'l Symp. High Performance Distributed Computing, pp. 209-216, 1996.
[42] K.C. Almeroth and M.H. Ammar, "Multicast Group Behavior in the Internet's Multicast Backbone (MBone)," IEEE Comm. Magazine, vol. 35, no. 6, pp. 124-129, June 1997.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool