Abstract
Efficient key distribution is an important problem for secure group communications. In this paper, we present a new group key distribution scheme that supports dynamic multicast group membership changes. Instead of using encryption algorithms, the scheme employs MDS codes, a class of error control codes. The scheme achieves both forward and backward secrecy of sessions using freshly generated random session keys. The computation complexity of key distribution is significantly reduced using proper MDS codes with efficient encoding and decoding algorithms. The computation load is also more evenly distributed among the group key distribution controller (GC) and all the group members. 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 dynamic group key distribution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Michel Abdalla, Yuval Shavitt, and Avishai Wool, “Towards Making Broadcast Encryption Practical”, IEEE/ACM Transactions on Networking, 8 (4): 443–454, August 2000.
M. Blaum, J. Bruck, A. Vardy, Mds Array Codes with Independent Parity Symbols, IEEE Trans. on Information Theory, 42 (2), 529–542, March 1996.
R. Blom, “An Optimal Class of Symmetric Key Generation Systems”, Advances in Cryptology,EUROCRYPT’84, LNCS 209, 335338, 1984. Dynamic Key Distribution
J. Bloemer, M. Kalfane, M. Karpinski, R. Karp, M. Luby and D. Zuckerman, “An XOR-Based Erasure-Resilient Coding Scheme”, ICSI Technical Report, TR-95–048, August 1995.
C. Blundo, A. Cresti, “Space Requirement for Broadcast Encryption”, Advances in Cryptology, EUROCRYPT’94, LNCS 950, 287298, 1995.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, “Perfectly Secure Key Distribution in Dynamic Conferences”, Advances in Cryptology, EUROCRYPT’92, LNCS 740, 47 1486, 1993.
C. Blundo, L. A. Frota Mattos, D. R. Stinson, “Trade-offs between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution”, Advances in Cryptology, CRYPTO’96, LNCS 1109, 387–400, 1996.
R. Canetti, T. Malkin, K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption”, Advances in Cryptology, EUROCRYPT 1999, May 1999.
G. H. Chou and W. T. Chen, Secure Broadcasting Using the Secure Lock, IEEE Trans. on Software Engineering, 15 (8), 929–934, Aug. 1989.
T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Son, 1991.
A. Fiat and M. Naor, “Broadcast Encryption”, Advances in Cryptology, CRYPTO’93, LNCS 773, 480–491, 1994.
M. Luby and J. Staddon, “Combinatorial Bounds for Broadcast Encryption”, Advances in Cryptology, EUROCRYPT’98, LNCS 1403, 512–526, 1998.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, Amsterdam: North-Holland, 1977.
R. J. McEliece and D. V. Sarwate, “On Sharing Secrets and Reed-Solomon Codes”, Communications of ACM,26(9), 583–584, Sep. 1981. Information, Coding and Mathematics
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 4th Printing, 1999.
S. Mittra, “Iolus: A Framework for Scalable Secure Multicasting”, Proc. of ACM SIGCOMMi’97, 277–288, Sep. 1997.
I. S. Reed and G. Solomon, Polynomial Codes over Certain Finite Fields, J. SIAM, 8 (10), 300–304, 1960.
A. Shamir, How to Share a Secret, Communications of ACM, 24 (11), 612–613, Nov. 1979.
J. Snoeyink, S. Suri and G. Varghese, A Lower Bound for Multicast Key Distribution, Proc. IEEE INFOCOM 2001, Apr. 2001.
D. R. Stinson, “On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption”, Designs, Codes and Cryptography, 12, 215–243, 1997.
D. R. Stinson and T. van Trung, “Some New Results on Key Distribution Patterns and Broadcast Encryption”, Designs, Codes and Cryptography, 14, 261–279, 1998.
M. Waldvogel, G. Caronni, D. Sun, N. Weiler and B. Plattner, The VersaKey Framework: Versatile Group Key Management, IEEE Journal on Selected Areas in Communications, 7 (8), 1614–1631, August 1999.
D. M. Wallner, E. J. Harder and R. C. Agee, “Key Management for Multicast: Issues and Architectures”, Internet Draft (work in progress), draft-wallner-key-arch-01.txt, Sep. 15, 1998.
C. K. Wong, M. Gouda and S. S. Lam, Secure Group Communications Using Key Graphs, Proc. ACM SIGCOMM’98, Sep. 1998.
L. Xu and J. Bruck, “X-Code: MDS Array Codes with Optimal Encoding,” IEEE Trans. on Information Theory, 45 (1), 272–276, Jan., 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xu, L. (2002). Dynamic Group Key Distribution Using MDS Codes. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3585-7_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5289-9
Online ISBN: 978-1-4757-3585-7
eBook Packages: Springer Book Archive