Abstract
This work considers the key management for secure multicast in the Logical Key Hierarchy (LKH) model, and proposes a methodology to establish the minimal key length that guarantees a specified level of confidentiality. We reach such a result by analyzing and extending the threat model to the confidentiality of the multicast information. For this extended threat model, we present a methodology that takes into account the following parameters: (1) the required lifetime of the information confidentiality; (2) the level of the key in the LKH model; (3) the dynamics of the multicast group, that is the eviction rate of the users. From these rationales we develop an analytical model that, for each level, derives the appropriate key length, that is the minimal length that assures the desired degree of confidentiality under the hypotheses in the threat model. Finally, for a specific instance of the LKH model, we describe a numerical example that shows the saving that can be achieved in terms of the key lengths.
This work was partially supported by the Eli IST-2001-34734 EYES project and by the Italian MIUR under the WEB-MINDS project.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35691-4_52
Chapter PDF
Similar content being viewed by others
Keywords
References
M. Abdalla, Y. Shavitt, and A. Wool. Key management for restricted multicast using broadcast encryption. IEEE/A CM Transaction on Networking, 8 (4), 2000.
D. Balenson, D. McGrew, and A. Sherman. Key management for large dynamic groups: One-way function trees and amortized initialization. Internet draft, IETF, June 2002.
Omer Berkman, Michal Parnas, and Jiri Sgall. Efficient dynamic traitor tracing. In Symposium on Discrete Algorithms, pages 586–595, 2000.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: a taxonomy and some efficient constructions. In Proceedings of IEEE INFOCOM’99: Conference on Computer Co7n7nunications, 1999.
R. Canetti, T. Malkin, and K. Nissim. Efficient communication-storage tradeoffs for multicast encryption. In Springer-Verlag, editor, Advances in Cryptology, EUROCRYPT 1999, volume 1592 of Lecture Notes in Computer Science, 1999.
Dee88] S. E. Deering. Multicast routing in internetworks and extended LANs. Computer Communication Review,18(4), 1988. ACM SIGCOMM ‘88 Symposium: Communications Architectures and Protocols.
H.Harney and E. Harder. Logical key hierarchy protocol. Internet draft, IETF, April 1999.
M. Kandausky, D. Chin, J. Wesley, and J. Provino. Tree-based reliable multicast (tram ). IETF Internet Draft, 2000.
D. A. McGrew and A. T. Sherman. Key establishment in large dynamic groups using one-way function trees. Technical Report 0755, TIS Labs at Network Associates, Inc., Glenwood, MD, May 1998.
Dalit Naor, Moni Naor, and.Jeff Lotspiech. Revocation and tracing schemes for stateless receivers. Lecture Notes in Computer Science, 2139: 41–62, 2001.
R. Di Pietro, L. V. Mancini, and S. Jajodia. Efficient and secure keys management for wireless mobile communications. In Proceedings of the second ACM international workshop on Principles of mobile computing, pages 66–73. ACM Press, 2002.
A. Perrig, D. Song, and D. Tygar. ELK, a new protocol for efficient large-group key distribution. In Proc. of 2001 IEEE Symposium on Security and Privacy, pages 247–262, 2001.
S. Rafaeli, L. Madly, and D. Hutchison. EHBT: an efficient protocol for group key management. Lecture Notes in Computer Science, 2233: 159171, 2001.
B. Schneier. Applied Cryptography: Protocols, Algorithms and Source Code in C. John Wiley and Sons, 1996.
M. Steiner, G. Tsudik, and M. Waidner. CLIQUES: A protocol suite for key agreement in dynamic groups. In Proceedings. 18th IEEE International Conference on Distributed Computing Systems, 1998.
W. Trappe, Jie Song, R. Poovendran, and K.J.R. Liu. Key distribution for secure multimedia multicasts via data embedding. In Proc. of IEEE ICASSP 2001, pages 1449–1452, 2001.
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, 17 (9): 1614–1631, September 1999.
C. K. Wong,,M. Gouda, and S. S. Lam. Secure group communications using key graphs. IEEE/ACM Transaction on Networking, 8 (1), 2000.
D. AVallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures. RFC 2627, June 1999.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: a performance analysis. In Proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pages 27–38. ACM Press, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Di Pietro, R., Mancini, L.V., Mei, A. (2003). A Time Driven Methodology for Key Dimensioning in Multicast Communications. In: Gritzalis, D., De Capitani di Vimercati, S., Samarati, P., Katsikas, S. (eds) Security and Privacy in the Age of Uncertainty. SEC 2003. IFIP — The International Federation for Information Processing, vol 122. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35691-4_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-35691-4_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6489-5
Online ISBN: 978-0-387-35691-4
eBook Packages: Springer Book Archive