TY - GEN
T1 - New broadcast encryption scheme using tree-based circle
AU - Jho, Nam Su
AU - Yoo, Eun Sun
AU - Cheon, Jung Hee
AU - Kim, Myung Hwan
PY - 2005
Y1 - 2005
N2 - Since broadcast encryption was first introduced in 1993 by Fiat and Naor, many broadcast encryption schemes have been developed. Among these, schemes based on tree structure and linear structure are notable. The subset difference (SD) scheme and layered subset difference (LSD) scheme based on tree structure have small user-key size and small transmission overhead when the number r of revoked users is very small. The punctured interval (PI) scheme based on linear (or circular) structure has better transmission over-head when r is not too small. In this paper, we propose a new broadcast encryption scheme, called the tree-based circle (TC) scheme, combining tree structure and circular structure. In this scheme, the transmission overhead is proportional to r like in the SD scheme for small r and becomes asymptotically same as that of the PI scheme when r grows, keeping the computation cost and the storage size small. The TC scheme also inherits the flexibility of the PI scheme. We further improve the transmission overhead of the TC scheme, when r is very small, by adopting the notion of cascade arc.
AB - Since broadcast encryption was first introduced in 1993 by Fiat and Naor, many broadcast encryption schemes have been developed. Among these, schemes based on tree structure and linear structure are notable. The subset difference (SD) scheme and layered subset difference (LSD) scheme based on tree structure have small user-key size and small transmission overhead when the number r of revoked users is very small. The punctured interval (PI) scheme based on linear (or circular) structure has better transmission over-head when r is not too small. In this paper, we propose a new broadcast encryption scheme, called the tree-based circle (TC) scheme, combining tree structure and circular structure. In this scheme, the transmission overhead is proportional to r like in the SD scheme for small r and becomes asymptotically same as that of the PI scheme when r grows, keeping the computation cost and the storage size small. The TC scheme also inherits the flexibility of the PI scheme. We further improve the transmission overhead of the TC scheme, when r is very small, by adopting the notion of cascade arc.
KW - Broadcast encryption
KW - Cascade
KW - Punctured interval
KW - Tree structure
UR - http://www.scopus.com/inward/record.url?scp=33745827414&partnerID=8YFLogxK
U2 - 10.1145/1102546.1102554
DO - 10.1145/1102546.1102554
M3 - Conference contribution
AN - SCOPUS:33745827414
SN - 1595932305
SN - 9781595932303
T3 - DRM'05 - Proceedings of the Fifth ACM Workshop on Digital Rights Management
SP - 37
EP - 44
BT - DRM'05 - Proceedings of the Fifth ACM Workshop on Digital Rights Management
T2 - DRM'05 - 5th ACM Workshop on Digital Rights Management
Y2 - 7 November 2005 through 7 November 2005
ER -