Abstract
We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and tolerating collusion among the revoked devices). In this paper, we restrict our attention to low-memory devices, that is, devices that can store at most O(log n) keys. We consider solutions for both zero-state and low-state cases, where such devices are organized in a tree structure T. We allow the group controller to encrypt broadcasts to any subtree of T, even if the tree is based on an multi-way organizational chart or a severely unbalanced multicast tree.
Chapter PDF
References
Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM J. Comput. 14(3), 545–568 (1985)
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)
Briscoe, B.: Marks: Zero side effect multicast key management using arbitrarily revealed key sequences. In: Proc. of First International Workshop on Networked Group Communication(NCGC 1999) (1999)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Proc. INFOCOM 1999, New York, March 1999, vol. 2, pp. 708–716 (1999)
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)
Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure Internet multicast using boolean function minimization techniques. In: Proc. IEEE INFOCOM, vol. 2, pp. 689–698 (1999)
Crescenzo, G.D., Kornievskaia, O.: Efficient kerberized multicast in a practical distributed setting. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 27–45. Springer, Heidelberg (2001)
Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis and Internet Examples. John Wiley & Sons, New York (2002)
Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Jung, E., Liu, A.X., Gouda, M.G.: Key bundles and parcels: Secure communication in many groups. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds.) NGC 2003 and ICQT 2003. LNCS, vol. 2816, pp. 119–130. Springer, Heidelberg (2003)
Kumar, R., Rajagopalan, R., Sahai, A.: Goding constructions for blackliting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609–623. Springer, Heidelberg (1999)
McGrew, D.A., Sherman, T.: Key establishment in large dynamic groups using one-way function trees. Technical Report 0755, TIS Labs at Network Associates Inc., Glenwood, MD (May 1998)
Micciancio, D., Panjwani, S.: Optimal communication complexity of generic multicast key distribution. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 153–170. Springer, Heidelberg (2004)
Mihajevic, M.J.: Key management schemes for stateless receivers based on time varying heterogeneous logical key hierarchy. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 137–154. Springer, Heidelberg (2003)
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)
Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, p. 1. Springer, Heidelberg (2001)
Pinkas, B.: Efficient state updates for key management. In: Proc. ACM Workshop on Security and Privacy in Digital Rights Management (2001)
Rodeh, O., Birman, K.P., Dolev, D.: Using AVL trees for fault tolerant group key management. International Journal on Information Security, 84–99 (2001)
Schneier, B.: Applied Cryptography, 2nd edn. John Wiley - Sons, Chichester (1996)
Sherman, T., McGrew, D.A.: Key establishment in large dynamic groups using one-way function trees. IEEE Trans. Software Engineering 29(5), 444–458 (2003)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Computer and System Sciences 26, 362–391 (1983)
Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: IEEE INFOCOM 2001, vol. 1, pp. 422–431 (2001)
Tamassia, R., Triandopoulos, N.: Computational bounds on hierarchical data processing with applications to information security. Technical report, Center for Geometric Computing, Brown University (2004)
Tipton, H.F., Krause, M. (eds.): Information Security Management Handbook, 4th edn. Auerbach (1999)
Wallner, D.M., Harder, E.G., Agee, R.C.: Key management for multicast: issues and architecture. In internet draft draft-waller-key-arch-01.txt (September 1998)
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. In: Proc. ACM SIGCOMM 1998, vol. 28, pp. 68–79 (1998)
Wong, C.K., Lam, S.S.: Digital signatures for flows and multicasts. IEEE/ACM Transactions on Networking 7, 502–513 (1999)
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
Goodrich, M.T., Sun, J.Z., Tamassia, R. (2004). Efficient Tree-Based Revocation in Groups of Low-State Devices. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive