Abstract
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by assigning probabilities for member revocations, the optimality, correctness, and the system requirements of some of these schemes [18, 19, 20, 21] can be systematically studied using information theoretic concepts. Specifically, we show that the optimal average number of keys per member in a rooted tree is related to the entropy of the member revocation event. Using our derivations we show that (a) the key assignments in [18, 21, 20, 19] correspond to the maximum entropy solution, (b) and direct application of source coding will lead to member collusion (we present recently proposed solutions [21, 20] as examples of this) and a general criteria that admits member collusion. We also show the relationship between entropy of member revocation event and key length.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Canetti, T. Malkin, and K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption”, In Eurocrypt 99, pp. 456–470.
T. Cover, J. Thomas, Elements of Information Theory, John Wiley & Sons, Inc, NY, 1991.
R. Gallager, Information theory and reliable communication, Wiley, NY, 1968.
J. L. Massey, “An Information-Theoretic Approach to Algorithms”, Impact of Processing Techniques in Communications, In NATO Advanced Study Institutes Series E91, pp. 3–20, 1985.
J. L. Massey, “Some Applications of Source Coding to Cryptography”, In European Trans. on Telecom., Vol. 5, pp. 421–429, July-August 1994.
H. N. Jendal, Y. J. B. Khun, and J. L. Massey, “An Information-Theoretic Approach to Homomorphic Substitution”, In Advances in Cryptology-Eurocrypt’89, LNCS-434, pp. 382–394, 1990.
U. M. Maurer, “Secret Key Agreement by Public Discussion from Common Information”, In IEEE Trans. IT, Vol 39, No. 3, 1993, pp 733–742.
R. Canetti, and B. Pinkas, “A taxonomy of multicast security issues”, Internet draft, April 1999.
Y. Desmedt, Y. Frankel, and M. Yung, “ Multi-receiver/Multi-sender network security: efficient authenticated multicast feedback”, IEEE Infocom’92, pp. 2045–2054.
M. steiner, G. Tsudik, and M. Waidner, “Diffe-Hellman key distribution extended to group communication”, 3rd ACM Conf. on Computer and Communications Security”, 1996.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, B. Pinkas, “Multicast Security: A Taxonomy and Efficient Reconstructions”, Proceedings of IEEE Infocom’99.
D. A. McGrew and A. Sherman, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees”, Manuscript, 1998.
A. Fiat and M. Naor, “Broadcast Encryption”, Advances in Cryptology-Crypto’92, Lecture Notes in Computer Science. vol. 773, pp. 481–491, Springer-Verlag, Berlin Germany, 1993.
A. Menezes, P. van Oorschot, and A. Vanstone, “Handbook of Applied Cryptography”, CRC Press, Boca Raton, 1997.
M. Naor and O. Reingold, “From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs”, Advances in Cryptology-Crypto’98, Lecture Notes in Computer Science. vol. 1462, pp. 267–282, Springer-Verlag, Berlin Germany, 1998.
M. Luby, Pseudo-Random Functions and Applications, Princeton University Press, 1996.
M. Brumester and Y. Desmedt, “A Secure and Efficient Conference Key Distribution System”, Advances in Cryptology-Eurocrypt’94, Lecture Notes in Computer Science. vol. 950, pp. 275–286, Springer-Verlag, Berlin Germany, 1994.
D. M. Wallner, E. C. Harder, and R. C. Agee, “Key Management for Multicast: Issues and Architectures”, Internet Draft, September 1998.
C. K. Wong, M. Gouda, S. S. Lam, “Secure Group Communications Using Key Graphs”, In Proceedings of ACM SIGCOMM’98, September 2–4, Vancouver, Canada.
G. Caronni, M. Waldvogel, D. Sun, and B. Plattner, “Efficient Security for Large and Dynamic Groups”, In Proc. of the Seventh Workshop on Enabling Technologies, IEEE Computer Society Press, 1998.
I. Chang, R. Engel, D. Kandlur, D. Pendarakis, D. Saha, “Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques”, To apper in Proceedings of IEEE Infocom’99.
S. Mittra, “Iolus: A framework for Scalable Secure Multicasting”, In Proceedings of ACM SIGGCOM’97, pages 277–288, September 1997.
H. Harney and C. Muckenhirn, “GKMP Architecture”, Request for Comments(RFC) 2093, July 1997.
R. Canetti, P-C. Cheng, D. Pendarakis, J. R. Rao, P. Rohatgi, D. Saha, “An Architecture for Secure Internet Multicast”, Internet Draft, November 1998.
T. Hardjono, B. Cain, and N. Doraswamy, “A Framework for Group Key Management for Multicast Security”, Internet draft, July 1998.
B. Quinn, “IP Multicast Applications: Challenges and Solutions”, Internet draft, November 1998.
H. Harney and C. Muckenhirn. “GKMP Specification”. Internet RFC 2094, July 1997.
A. Ballardie. “Scalable Multicast Key Distribution”. Internet RFC 1949, May 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poovendran, R., Baras, J.S. (1999). An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive