Generic transformation for scalable broadcast encryption schemes

Jung Yeon Hwang, Dong Hoon Lee, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many communication in broadcasting, transmission length may be of major concern. Several broadcast encryption schemes with good transmission overhead have been proposed. But, these broadcast encryption schemes are not practical since they are greatly sacrificing performance of other efficiency parameters to achieve good performance in transmission length. In this paper we study a generic transformation method which transforms any broadcast encryption scheme to one suited to desired application environments while preserving security. Our transformation reduces computation overhead and/or user storage by slightly increasing transmission overhead of a given broadcast encryption scheme. We provide two transformed instances. The first instance is comparable to the results of the "stratified subset difference (SSD)" technique by Goodrich et al. and firstly achieves script o sign(log n) storage, script o sign(log n) computation, and script o sign(log n/log log n r) transmission, at the same time, where n is the number of users and r is the number of revoked users. The second instance outperforms the "one-way chain based broadcast encryption" of Jho et al., which is the best known scheme achieving less than r transmission length with reasonable communication and storage overhead.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages276-292
Number of pages17
Volume3621 LNCS
Publication statusPublished - 2006 Jun 23
Event25th Annual International Cryptology Conference, CRYPTO 2005 - Santa Barbara, CA, United States
Duration: 2005 Aug 142005 Aug 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3621 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other25th Annual International Cryptology Conference, CRYPTO 2005
CountryUnited States
CitySanta Barbara, CA
Period05/8/1405/8/18

Fingerprint

Broadcast Encryption
Cryptography
One to many
Communication
Broadcasting
Broadcast
Receiver
Transform
Subset

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Hwang, J. Y., Lee, D. H., & Lim, J. I. (2006). Generic transformation for scalable broadcast encryption schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3621 LNCS, pp. 276-292). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3621 LNCS).

Generic transformation for scalable broadcast encryption schemes. / Hwang, Jung Yeon; Lee, Dong Hoon; Lim, Jong In.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3621 LNCS 2006. p. 276-292 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3621 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hwang, JY, Lee, DH & Lim, JI 2006, Generic transformation for scalable broadcast encryption schemes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3621 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3621 LNCS, pp. 276-292, 25th Annual International Cryptology Conference, CRYPTO 2005, Santa Barbara, CA, United States, 05/8/14.
Hwang JY, Lee DH, Lim JI. Generic transformation for scalable broadcast encryption schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3621 LNCS. 2006. p. 276-292. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hwang, Jung Yeon ; Lee, Dong Hoon ; Lim, Jong In. / Generic transformation for scalable broadcast encryption schemes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3621 LNCS 2006. pp. 276-292 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3ac686b734db404384c37978cad86413,
title = "Generic transformation for scalable broadcast encryption schemes",
abstract = "Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many communication in broadcasting, transmission length may be of major concern. Several broadcast encryption schemes with good transmission overhead have been proposed. But, these broadcast encryption schemes are not practical since they are greatly sacrificing performance of other efficiency parameters to achieve good performance in transmission length. In this paper we study a generic transformation method which transforms any broadcast encryption scheme to one suited to desired application environments while preserving security. Our transformation reduces computation overhead and/or user storage by slightly increasing transmission overhead of a given broadcast encryption scheme. We provide two transformed instances. The first instance is comparable to the results of the {"}stratified subset difference (SSD){"} technique by Goodrich et al. and firstly achieves script o sign(log n) storage, script o sign(log n) computation, and script o sign(log n/log log n r) transmission, at the same time, where n is the number of users and r is the number of revoked users. The second instance outperforms the {"}one-way chain based broadcast encryption{"} of Jho et al., which is the best known scheme achieving less than r transmission length with reasonable communication and storage overhead.",
author = "Hwang, {Jung Yeon} and Lee, {Dong Hoon} and Lim, {Jong In}",
year = "2006",
month = "6",
day = "23",
language = "English",
isbn = "3540281142",
volume = "3621 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "276--292",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Generic transformation for scalable broadcast encryption schemes

AU - Hwang, Jung Yeon

AU - Lee, Dong Hoon

AU - Lim, Jong In

PY - 2006/6/23

Y1 - 2006/6/23

N2 - Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many communication in broadcasting, transmission length may be of major concern. Several broadcast encryption schemes with good transmission overhead have been proposed. But, these broadcast encryption schemes are not practical since they are greatly sacrificing performance of other efficiency parameters to achieve good performance in transmission length. In this paper we study a generic transformation method which transforms any broadcast encryption scheme to one suited to desired application environments while preserving security. Our transformation reduces computation overhead and/or user storage by slightly increasing transmission overhead of a given broadcast encryption scheme. We provide two transformed instances. The first instance is comparable to the results of the "stratified subset difference (SSD)" technique by Goodrich et al. and firstly achieves script o sign(log n) storage, script o sign(log n) computation, and script o sign(log n/log log n r) transmission, at the same time, where n is the number of users and r is the number of revoked users. The second instance outperforms the "one-way chain based broadcast encryption" of Jho et al., which is the best known scheme achieving less than r transmission length with reasonable communication and storage overhead.

AB - Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many communication in broadcasting, transmission length may be of major concern. Several broadcast encryption schemes with good transmission overhead have been proposed. But, these broadcast encryption schemes are not practical since they are greatly sacrificing performance of other efficiency parameters to achieve good performance in transmission length. In this paper we study a generic transformation method which transforms any broadcast encryption scheme to one suited to desired application environments while preserving security. Our transformation reduces computation overhead and/or user storage by slightly increasing transmission overhead of a given broadcast encryption scheme. We provide two transformed instances. The first instance is comparable to the results of the "stratified subset difference (SSD)" technique by Goodrich et al. and firstly achieves script o sign(log n) storage, script o sign(log n) computation, and script o sign(log n/log log n r) transmission, at the same time, where n is the number of users and r is the number of revoked users. The second instance outperforms the "one-way chain based broadcast encryption" of Jho et al., which is the best known scheme achieving less than r transmission length with reasonable communication and storage overhead.

UR - http://www.scopus.com/inward/record.url?scp=33745140894&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745140894&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540281142

SN - 9783540281146

VL - 3621 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 276

EP - 292

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -