[Resource Topic] 2005/136: Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption

Welcome to the resource topic for 2005/136

Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption

Authors: Jung Hee Cheon, Nam-su Jho, Myung-Hwan Kim, Eun Sun Yoo


We develop a couple of new methods to reduce transmission
overheads in broadcast encryption. The methods are based on the
idea of assigning {\it one key per each partition using one-way
key chains} after partitioning the users. One method adopts {\it
skipping chains} on partitions containing up to p revoked users
and the other adopts {\it cascade chains} on partitions with layer
structure. The scheme using the former reduces the transmission
overhead down to \frac r{p+1} asymptotically as r grows, and
the scheme using the latter keeps the transmission overhead very
small when r approaches 0, where r is the number of revoked
users. Combining the two schemes, we propose a new broadcast
encryption scheme with least transmission overhead. Our schemes
also possess a remarkable feature that any number of new users can
join at any time without key update, which is not available for
most of known practical schemes.

ePrint: https://eprint.iacr.org/2005/136

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .