Abstract
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitrarily nested application of a symmetric-key encryption scheme, with random or pseudorandom keys. Our lower bound shows that the amortized cost of updating the group key for a secure multicast protocol (measured as the number of messages transmitted per membership change) is log2(n) + o(1). This lower bound matches (up to a small additive constant) the upper bound of Canetti, Garay, Itkis, Micciancio, Naor and Pinkas (Infocomm 1999), and is essentially optimal.
This material is based upon work supported by the National Science Foundation under Grant CCR-0313241 and a Sloan Research Fellowship. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
Chapter PDF
Similar content being viewed by others
References
Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology 15(2), 103–127 (2002)
Boneh, D., Durfee, G., Franklin, M.: Lower bounds for multicast message authentication. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 437–452. Springer, Heidelberg (2001)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: INFOCOM 1999. Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, New York, NY, March 1999, vol. 2, pp. 708–716. IEEE, Los Alamitos (1999)
Canetti, R., Malkin, T., Nissim, K.: Efficient communication-storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 459. Springer, Heidelberg (1999)
Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)
Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Gennaro, R.: A protocol to achieve independence in constant rounds. IEEE Transactions on Parallel and Distributed Systems 11(7), 636–647 (2000)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33, 792–807 (1986)
Harney, H., Muckenhirn, C.: Group key management protocol (GKMP) architecture. Request for Comments 2094, Internet Engineering Task Force (July 1997)
Harney, H., Muckenhirn, C.: Group key management protocol (GKMP) specification. Request for Comments 2093, Internet Engineering Task Force (July 1997)
Luby, M., Staddon, J.: Combinatorial Bounds for Broadcast Encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 512–526. Springer, Heidelberg (1998)
Micciancio, D., Warinschi, B.: Completeness theorems for the abadi-rogaway logic of encrypted expressions. Journal of Computer Security 12(1), 99–129 (2002); Preliminary version in WITS 2002
Perrig, A., Song, D.X., Tygar, J.D.: ELK, A New Protocol for Efficient Large- Group Key Distribution. In: IEEE Symposium on Security and Privacy, Oakland, CA, USA, May 2001, pp. 247–262. IEEE, Los Alamitos (2001)
Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: INFOCOM 2001. Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, New York, NY, April 2001, vol. 1, pp. 422–431. IEEE, Los Alamitos (2001)
Wallner, D.M., Harder, E.G., Agee, R.C.: Key management for multicast: issues and architecture. Request for Comments 2627, Internet Engineering Task Force (June 1999)
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Transactions on Networking 8(1), 16–30 (2000); Preliminary version in SIGCOMM 1998
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Micciancio, D., Panjwani, S. (2004). Optimal Communication Complexity of Generic Multicast Key Distribution. In: Cachin, C., Camenisch, J.L. (eds) Advances in Cryptology - EUROCRYPT 2004. EUROCRYPT 2004. Lecture Notes in Computer Science, vol 3027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24676-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24676-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21935-4
Online ISBN: 978-3-540-24676-3
eBook Packages: Springer Book Archive