TY - GEN
T1 - Generic transformation for scalable broadcast encryption schemes
AU - Hwang, Jung Yeon
AU - Lee, Dong Hoon
AU - Lim, Jongin
PY - 2006
Y1 - 2006
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
AN - SCOPUS:33745140894
SN - 3540281142
SN - 9783540281146
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 276
EP - 292
BT - Advances in Cryptology - CRYPTO 2005 - 25th Annual International Cryptology Conference, Proceedings
T2 - 25th Annual International Cryptology Conference, CRYPTO 2005
Y2 - 14 August 2005 through 18 August 2005
ER -