An efficient time-bound hierarchical key management scheme for secure broadcasting

被引:57
作者
Bertino, Elisa [1 ,2 ]
Shang, Ning [1 ,3 ,4 ]
Wagstaff, Samuel S., Jr. [1 ,2 ]
机构
[1] Purdue Univ, CERIAS, W Lafayette, IN 47907 USA
[2] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
[3] Purdue Univ, Dept Elect & Comp Engn, W Lafayette, IN 47907 USA
[4] Purdue Univ, Dept Math, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
secure broadcasting; time-bound hierarchical key management; elliptic curves; elliptic-curve discrete logarithm problem (ECDLP);
D O I
10.1109/TDSC.2007.70241
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In electronic subscription and pay TV systems, data can be organized and encrypted using symmetric key algorithms according to predefined time periods and user privileges and then broadcast to users. This requires an efficient way of managing the encryption keys. In this scenario, time-bound key management schemes for a hierarchy were proposed by Tzeng and Chien in 2002 and 2005, respectively. Both schemes are insecure against collusion attacks. In this paper, we propose a new key assignment scheme for access control, which is both efficient and secure. Elliptic-curve cryptography is deployed in this scheme. We also provide the analysis of the scheme with respect to security and efficiency issues.
引用
收藏
页码:65 / 70
页数:6
相关论文
共 13 条