Abstract
This paper proposes a family of key management schemes for broadcast encryption based on a novel underlying structure – Time Varying Heterogeneous Logical Key Hierarchy (TVH-LKH). Note that the main characteristics of the previously reported key management schemes include the following: employment of a static underlying structure for key management, and addressing the subset covering problem over the entire underlying structure. Oppositely, the main underlying ideas for developing of the novel key management schemes based on TVH-LKH include the following: (i) employment of a reconfigurable underlying structure; and (ii) employment of a divide-and-conquer approach related to the underlying structure and an appropriate communications-storage-processing trade-off (for example, a small increase of the communication overload and large reduction of the storage and processing overload) for addressing the subset covering problem and optimization of the overloads. The design is based on a set of “static” keys at a receiver (stateless receiver) which are used in all possible reconfiguration of the underlying structure for key management, and accordingly, in a general case, a key plays different roles depending on the employed underlying structure. A particular family of the components for developing TVH-LKH, is also proposed and discussed. The proposed technique is compared with the recently reported schemes, and the advantages of the novel one are pointed out.
Chapter PDF
Similar content being viewed by others
Keywords
References
Abdalla, M., Shavitt, Y., Wool, A.: Key management for restricted multicast using broadcast encryption. IEEE/ACM Trans. Networking 8, 443–454 (2000)
Banerjee, S., Bhattacharjee, B.: Scalable secure group communication over IP multicast. IEEE Journal on Selected Areas in Communications 20, 1511–1527 (2002)
Canetti, R., Malkin, T., Nissim, K.: Efficient communication-storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 459–474. Springer, Heidelberg (1999)
Chan, K.-C., Gary Chan, S.-H.: Distributed server networks for secure multicast. IEEE Journal on Selected Areas in Communications 20, 1500–1510 (2002)
D’Arco, P., Stinson, D.R.: Fault tolerant and distributedBroadcast encryption. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 263–280. Springer, Heidelberg (2003)
Di Crescenzo, G., Kornievskaia, O.: Efficient re-keying protocols for multicast encryption. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 119–132. Springer, Heidelberg (2003)
Feige, U.: A threshold of ln(n) for approximating set cover. Jour. ACM 45, 634–652 (1998)
Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Garay, J.A., Staddon, J., Wool, A.: Long-lived broadcast encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 333–352. Springer, Heidelberg (2000)
Garey, M.R., Jonson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Lotspiech, J., Nusser, S., Prestoni, F.: Broadcast encryption’s bright future. IEEE Computer, 7 pages (August 2002)
Ki, J.H., Kim, H.J., Lee, D.H., Park, C.S.: Efficient multicast key management for stateless receivers. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 497–509. Springer, Heidelberg (2003)
Matsuzaki, N., Nakano, T., Matsumoto, T.: A flexible tree-based key management framework. IEICE Trans. Fundamentals E86-A, 129–135 (2003)
Mihaljević, M.J.: Broadcast encryption schemes based on the sectioned key tree. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 158–169. Springer, Heidelberg (2003)
Mittra, S.: Iolus: A framework for scalable secure multicasting. In: Proc. ACM SIGGCOM 1997, September 1997, pp. 277–288 (1997)
Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)
Poovendran, R., Baras, J.S.: An information theoretic approach for design and analysis of rooted-tree-based multicast key management schemes. IEEE Trans. Inform. Theory 47, 2824–2834 (2001)
Poovendran, R., Bernstein, C.: Design of secure multicast key management schemes with communication budget constraint. IEEE Communications Letters 6, 108–110 (2002)
Wallner, D., Harder, E., Agee, R.: Key management for multicast: Issues and architectures, RFC 2627, http://www.ietf.org/rfc/rfc2627.txt
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Networking 8, 16–31 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mihaljević, M.J. (2003). Key Management Schemes for Stateless Receivers Based on Time Varying Heterogeneous Logical Key Hierarchy. In: Laih, CS. (eds) Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40061-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-40061-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20592-0
Online ISBN: 978-3-540-40061-5
eBook Packages: Springer Book Archive