Scalable Multicast Key Distribution

نویسنده

  • Tony Ballardie
چکیده

groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a \working draft" or \work in progress." Abstract Multicasting is becoming an increasingly important and desired form of communication on the Internet, not surprisingly because its typical applications include audio-and video conferencing 4]. Providing security services, such as traac conndentiality, for multicast communication is particularly problematic, since it involves securely distributing a group key to each of a group's receivers. Traditionally, the key distribution function has been assigned to a central network entity, or Key Distribution Centre (KDC), but this method does not scale for wide-area multicasting, where group members may be widely-distributed across the internetwork, and a wide-area group may be densely populated. No eeective solution to this problem has been proposed to date. This paper addresses the multicast key distribution problem and provides a scal-able solution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable secure one-to-many group communication using dual encryption

Multicasting is a scalable solution for group communication. Whereas secure unicast is a well-understood problem, scalable secure multicast poses several unique security problems, namely groupmembership control, scalable key distribution to a dynamic group. We address scalability in the pro-posed protocol by using hierarchical subgrouping. Third party hosts or members of the mul...

متن کامل

Comparison of Scalable Key Distribution Schemes for Secure Group Communication

Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper; we compare recently proposed hierarchical key d...

متن کامل

Mykil: a highly scalable key distribution protocol for large group multicast

This paper describes the design, implementation, and evaluation of Mykil, which is a new key distribution protocol for secure group multicast. Mykil has been designed to be scalable to large group sizes. It is based on a combination of group-based hierarchy and key-based hierarchy systems for group key management. Important advantages of Mykil include a fast rekeying operation for large group s...

متن کامل

A comparative performance analysis of reliable group rekey transport protocols for secure multicast

Scalable group rekeying is one of the important problems that needs to be addressed in order to support secure multicast communications for large and dynamic groups. One of the challenging issues that arises in scalable group rekeying is the problem of delivering the updated keys to the members of the group in a reliable and timely manner. In this paper, we present a new scalable and reliable k...

متن کامل

A New Secure Multicast Key Distribution Scheme Using Tabulation Method

In the present paper, we propose a new scheme for a scalable multicast key distribution scheme. The present scheme is based on the Key Management using Tabulation method of Boolean Function Simplification technique. It explores the use of batching of group membership changes to reduce the frequency, and hence the cost, of key re-distribution operations. It focuses explicitly on the issue of sno...

متن کامل

Efficient Clustering for Multicast Key Distribution in MANETs

Securing multicast communications in ad hoc networks must consider several challenging factors such as high nodes mobility, limited bandwidth and constrained energy. Moreover, the establishment of a key management protocol within ad hoc environments meets the “1 affects n” problem, which is more critical in such type of networks, due to the high dynamicity of groups. In this paper, we present a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RFC

دوره 1949  شماره 

صفحات  -

تاریخ انتشار 1996