Advertisement

Efficient Re-keying Protocols for Multicast Encryption

  • Giovanni Di Crescenzo
  • Olga Kornievskaia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2576)

Abstract

Never halting growth of the Internet has influenced the development and use of multicast communication which is proving to be an effective method for delivery of data to multiple recipients. Vast number of applications come to benefit from this efficient means of communication. With existing security threats in the Internet it has become imperative to look into multicast security. One of the challenges in securing multicast communication is to efficiently establish and manage shared keys in large and dynamic groups.

In this paper we propose very efficient re-keying protocols for multicast encryption. One of our protocols has complexity at most logarithmic in all measures considered in the literature, namely, communication, number of keys stored by the user and by the center, and time complexity per update.

We then analyze the performance of the family of tree-based re-keying protocols for multicast encryption, with respect to a set of multiple update operations, and show that for a particular class of such updates, we can modify these schemes so that they guarantee essentially optimal performance. Specifically, while performing m update operations each one at a time would guarantee a complexity of O(mlog n), we show that for a specific (but large) class of instances, we can modify the schemes so that they guarantee O(log n) communication complexity only, by keeping the user storage complexity O(log n), n being the maximum size of the multicast group.

Keywords

Communication Complexity Block Cipher Multicast Group Multicast Communication Broadcast Encryption 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Anzai, N. Matsuzaki and T. Matsumoto, A quick group key distribution scheme with entity revocation. In Proceedings of “Advances in Cryptology-ASIACRYPT 99”, Lecture Notes in Computer Science, Springer Verlag, 1999.Google Scholar
  2. 2.
    K. Becker and U. Wille. Communication complexity of group key distribution. In Proceedings of the 5th ACM Conference on Computer and Communication Security, San Francisco, CA, November 1998.Google Scholar
  3. 3.
    M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In Proceedings of “Advances in Cryptology-EUROCRYPT’94”, Lecture Notes in Computer Science, 1994.Google Scholar
  4. 4.
    C. Blundo and A. Cresti. Space Requirements for Broadcast Encryption. In Proceedings of “Advances in Cryptology-EUROCRYPT’94”, Lecture Notes in Computer Science, 1994.Google Scholar
  5. 5.
    C. Blundo, L. Frota Mattos and D. Stinson. Trade-Offs between communication and storage in unconditionally secure systems for broadcast encryption and interactive key-distribution. In Proceedings of “Advances in Cryptology-CRYPTO’96”, Lecture Notes in Computer Science, 1996.Google Scholar
  6. 6.
    C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly-secure key distribution for dynamic conferences. In Proceedings of “Advances in Cryptology-CRYPTO’92”, Lecture Notes in Computer Science, 1993.Google Scholar
  7. 7.
    R. Canetti, J. Garay, G. Itkis, D. Miccianco, M. Naor, and B. Pinkas. Multicast security: A taxonomy and efficient authentication. In IEEE INFOCOMM, 1999.Google Scholar
  8. 8.
    R. Canetti, T. Malkin, and K. Nissim. Efficient communication storage tradeoffs for multicast encryption. In Proceedings of “Advances in Cryptology-EUROCRYPT’ 99”, Lecture Notes in Computer Science, Springer Verlag, 1999.Google Scholar
  9. 9.
    R. Canetti and B. Pinkas. A taxonomy of multicast security issues. Internet Draft, August 2000.Google Scholar
  10. 10.
    I. Chang, R. Engel, D. Kandlur, D. Pendarakis, and D. Saha. Key management for secure internet multicast using boolean function minimization techniques. In IEEE INFOCOMM, 1999.Google Scholar
  11. 11.
    A. Fiat and M. Naor, Broadcast Encryption. In Proceedings of “Advances in Cryptology-CRYPTO 93”, Lecture Notes in Computer Science, Springer Verlag, 1994.Google Scholar
  12. 12.
    D. Halevy and A. Shamir, The LSD Broadcast Encryption Scheme, In Proceedings of “Advances in Cryptology-CRYPTO 02”, Lecture Notes in Computer Science, Springer Verlag, 2002.Google Scholar
  13. 13.
    I. Ingemarsson, D. Tang, and C. Wong. A conference key distribution system. IEEE Transactions on Information Theory, 28(5):714–720, September 1982.Google Scholar
  14. 14.
    Y. Kim, A. Perrig, and G. Tsudik. Simple and fault-tolerant key agreement for dynamic collaborative groups. In Proceedings of the 7th ACM Conference on Computer and Communication Security, CCS’00, November 2000.Google Scholar
  15. 15.
    M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Proceedings of “Advances in Cryptology-EUROCRYPT’98”, Lecture Notes in Computer Science, Springer Verlag, 1998.Google Scholar
  16. 16.
    S. Naor, M. Naor, and J. Lotspiech, Revocation and Tracing Schemes for Stateless Receivers, In Proceedings of “Advances in Cryptology-CRYPTO 01”, Lecture Notes in Computer Science, Springer Verlag, 2001.Google Scholar
  17. 17.
    A. Perrig. Efficient collaborative key management protocols for secure autonomous group communication. In CryptTEC, 1999.Google Scholar
  18. 18.
    R. Poovendram and J. Baras. An information theoretic analysis of rooted-tree based secure multicast key distribution. In Proceedings of “Advances in Cryptology-CRYPTO’99”, Lecture Notes in Computer Science, Springer Verlag, 1999.Google Scholar
  19. 19.
    R. Safavi-Naini and H. Wang. New constructions for multicast re-keying schemes using perfect hash families. In Proceedings of the 7th ACM Conference on Computer and Communication Security, CCS’00, Ahtens, Greece, 2000.Google Scholar
  20. 20.
    D. Steer, L. Strawczynski, W. Diffie, and W. Wiener. A secure audio teleconference system. In Proceedings of “Advances in Cryptology-CRYPTO’88”, Lecture Notes in Computer Science, Springer Verlag, Santa Barbara, CA, August 1988.Google Scholar
  21. 21.
    M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. In IEEE Transactions on Parallel and Distributed Systems, 2000.Google Scholar
  22. 22.
    D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures. RFC 2627, June 1999.Google Scholar
  23. 23.
    C. Wong, M. Gouda, and S. Lam. Secure group communication using key graphs. In Proceedings of the ACM SIGCOMM’98, September 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Giovanni Di Crescenzo
    • 1
  • Olga Kornievskaia
    • 2
  1. 1.CITIUniversity of MichiganUSA
  2. 2.Telcordia TechnologiesMorristownUSA

Personalised recommendations