The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (2009 vol.6)
pp: 159-160
Hung-Min Sun , National Tsing Hua University, Hsinchu
King-Hang Wang , National Tsing Hua University, Hsinchu
Chien-Ming Chen , National Tsing Hua University, HsingChu
ABSTRACT
Recently, Bertino et al. proposed a new time-bound key management scheme for broadcasting. The security of their scheme is planted on the hardness breaking of elliptic curve discrete log problem, HMAC, and tamper-resistance devices. They claimed that as long as the three assumptions hold, their scheme is secure. By means of secure, users cannot access resources that they are not granted, even if users collude. In this paper, we demonstrate that this scheme is insecure against the collusion attack. We also provide some possible amendments to this scheme.
INDEX TERMS
Time-bound key management, cryptanalysis.
CITATION
Hung-Min Sun, King-Hang Wang, Chien-Ming Chen, "On the Security of an Efficient Time-Bound Hierarchical Key Management Scheme", IEEE Transactions on Dependable and Secure Computing, vol.6, no. 2, pp. 159-160, April-June 2009, doi:10.1109/TDSC.2009.15
REFERENCES
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool