The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2008 vol.19)
pp: 577-587
ABSTRACT
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose {\\em computation} complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree based schemes, this scheme provides much lower computation complexity, while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.
INDEX TERMS
key distribution, Multicast, MDS codes, erasure decoding, computation, Complexity
CITATION
Lihao Xu, Cheng Huang, "Computation-Efficient Multicast Key Distribution", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 5, pp. 577-587, May 2008, doi:10.1109/TPDS.2007.70759
REFERENCES
[1] AES Algorithm (Rijndael) Information, http://csrc.nist.gov/Crypto Toolkit/aesrijndael /, 2007.
[2] M. Abdalla, Y. Shavitt, and A. Wool, “Towards Making Broadcast Encryption Practical,” IEEE/ACM Trans. Networking, vol. 8, no. 4, pp. 443-454, Aug. 2000.
[3] M. Blaum, J. Bruck, and A. Vardy, “MDS Array Codes with Independent Parity Symbols,” IEEE Trans. Information Theory, vol. 42, no. 2, pp. 529-542, Mar. 1996.
[4] R. Blom, “An Optimal Class of Symmetric Key Generation Systems,” Advances in Cryptology—Proc. Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT '84), pp.335-338, 1984.
[5] J. Bloemer, M. Kalfane, M. Karpinski, R. Karp, M. Luby, and D. Zuckerman, “An XOR-Based Erasure-Resilient Coding Scheme,” Technical Report TR-95-048, Int'l Computer Science Inst., Aug. 1995.
[6] C. Blundo and A. Cresti, “Space Requirement for Broadcast Encryption,” Advances in Cryptology—Proc. Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT '95), pp. 287-298, 1995.
[7] C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “Perfectly Secure Key Distribution in Dynamic Conferences,” Advances in Cryptology—Proc. Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT '93), pp. 471-486, 1993.
[8] C. Blundo, L.A. Frota Mattos, and D.R. Stinson, “Trade-Offs between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution,” Advances in Cryptology—Proc. 16th Ann. Int'l Cryptology Conf. (CRYPTO '96), pp. 387-400, 1996.
[9] R.E. Bryant and D.R. O'Hallaron, Computer Systems: A Programmer's Perspective. Prentice Hall, 2002.
[10] R. Canetti, T. Malkin, and K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption,” Advances in Cryptology—Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '99), May 1999.
[11] G.H. Chou and W.T. Chen, “Secure Broadcasting Using the Secure Lock,” IEEE Trans. Software Eng., vol. 15, no. 8, pp. 929-934, Aug. 1989.
[12] T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
[13] W. Dai, Crypto++ Library, http://www.eskimo.com/~weidaicryptlib.html , 2007.
[14] A. Fiat and M. Naor, “Broadcast Encryption,” Advances in Cryptology—Proc. 13th Ann. Int'l Cryptology Conf. (CRYPTO '94), pp. 480-491, 1994.
[15] H. Harney and E. Harder, Logical Key Hierarchy Protocol, IETF Internet draft, work in progress, Mar. 1999.
[16] X. Lai, J. Massey, and S. Murphy, “Markov Ciphers and Differential Cryptanalysis,” Advances in Cryptology—Proc. Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT '92), pp. 17-38, 1992.
[17] X.S. Li, Y.R. Yang, M.G. Gouda, and S.S. Lam, “Batch Rekeying for Secure Group Communications,” Proc. 10th Int'l World Wide Web Conf. (WWW '01), May 2001.
[18] M. Luby and J. Staddon, “Combinatorial Bounds for Broadcast Encryption,” Advances in Cryptology—Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '98), pp. 512-526, 1998.
[19] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes. North-Holland Math. Library, 1977.
[20] R.J. McEliece and D.V. Sarwate, “On Sharing Secrets and Reed-Solomon Codes,” Comm. ACM, vol. 26, no. 9, pp. 583-584, Sept. 1981.
[21] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, fourth ed. CRC Press, 1999.
[22] S. Mittra, “Iolus: A Framework for Scalable Secure Multicasting,” Proc. ACM SIGCOMM '97, pp. 277-288, Sept. 1997.
[23] J.S. Plank, “A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-Like Systems,” Software: Practice and Experience, vol. 27, no. 9, pp. 995-1012, Jan. 1999.
[24] J.S. Plank and Y. Ding, “Correction to the 1997 Tutorial on Reed-Solomon Coding,” Software: Practice and Experience, vol. 35, no. 2, pp. 189-194, Feb. 2005.
[25] J.S. Plank and L. Xu, “Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications,” Proc. Fifth IEEE Int'l Symp. Network Computing and Applications (NCA '06), July 2006.
[26] 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.
[27] O. Rodeh, K. Birman, and D. Dolev, “The Architecture and Performance of Security Protocols in the Ensemble Group Communication System,” ACM Trans. Information and System Security, vol. 4, no. 3, pp. 289-319, Aug. 2001.
[28] I.S. Reed and G. Solomon, “Polynomial Codes over Certain Finite Fields,” J. SIAM, vol. 8, no. 10, pp. 300-304, 1960.
[29] C. Adams, The CAST-128 Encryption Algorithm, IETF RFC 2144, http://www.faqs.org/rfcsrfc2144.html, May 1997.
[30] V. Rijmen, A. Bosselaers, and P. Barreto, Optimised C Code V3.0 (of AES/Rijndael), http://www.esat.kuleuven.ac.be/ rijmenrijndael-fst-3.0.zip , 2007.
[31] B. Schneier, Applied Cryptography, second ed. John Wiley & Sons, 1996.
[32] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 24, no. 11, pp. 612-613, Nov. 1979.
[33] 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.
[34] J. Snoeyink, S. Suri, and G. Varghese, “A Lower Bound for Multicast Key Distribution,” Proc. IEEE INFOCOM '01, Apr. 2001.
[35] D.R. Stinson, “On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption,” Designs, Codes and Cryptography, vol. 12, pp. 215-243, 1997.
[36] D.R. Stinson and T. van Trung, “Some New Results on Key Distribution Patterns and Broadcast Encryption,” Designs, Codes and Cryptography, vol. 14, pp. 261-279, 1998.
[37] M. Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner, “The VersaKey Framework: Versatile Group Key Management,” IEEE J. Selected Areas in Comm., vol. 7, no. 8, pp. 1614-1631, Aug. 1999.
[38] D.M. Wallner, E.J. Harder, and R.C. Agee, “Key Management for Multicast: Issues and Architectures,” IETF Internet draft, Sept. 1998.
[39] C.K. Wong, M. Gouda, and S.S. Lam, “Secure Group Communications Using Key Graphs,” Proc. ACM SIGCOMM '98, Sept. 1998.
[40] L. Xu and J. Bruck, “X-Code: MDS Array Codes with Optimal Encoding,” IEEE Trans. Information Theory, vol. 45, no. 1, pp. 272-276, Jan. 1999.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool