Skipping, cascade, and combined chain schemes for broadcast encryption

Jung Hee Cheon, Nam Su Jho, Myung Hwan Kim, Eun Sun Yoo

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

We develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way key chains after partitioning the users. One method adopts skipping chains on partitions containing up top revoked users and the other adopts cascade chains on partitions with layer structure. The scheme using the former has the transmission overhead r/p+1 + N-r/c, which is less than r/p if r > p2 N/c. The scheme using the latter keeps the same transmission overhead with the Subset Difference (SD) scheme when r approaches 0, where r is the number of revoked users. Combining the two schemes, we propose a new broadcast encryption scheme whose transmission overhead is the same with that of the SD scheme for small r and becomes smaller than that of the SD as r grows. The scheme using skipping chains possesses an advantage that any number of new users can join any time at no cost for current users. Finally, we show that the proposed key assignment scheme satisfies key-indistinguishability assuming pseudorandom generators.

Original languageEnglish
Pages (from-to)5155-5171
Number of pages17
JournalIEEE Transactions on Information Theory
Volume54
Issue number11
DOIs
StatePublished - 2008

Keywords

  • Broadcast encryption
  • Cascade chain
  • Combined chain
  • One-way key chain
  • Revocation
  • Skipping chain

Fingerprint

Dive into the research topics of 'Skipping, cascade, and combined chain schemes for broadcast encryption'. Together they form a unique fingerprint.

Cite this