On the security of an efficient time-bound hierarchical key management scheme

Hung-Min Sun; King-Hang Wang; Chien-Ming Chen

doi:10.1109/TDSC.2009.15

Back

On the security of an efficient time-bound hierarchical key management scheme

Journal article

Peer reviewed

On the security of an efficient time-bound hierarchical key management scheme

Hung-Min Sun, King-Hang Wang and Chien-Ming Chen

IEEE Transactions on Dependable and Secure Computing, Vol.6(2), pp.159-160

04/2009

DOI: https://doi.org/10.1109/TDSC.2009.15

Abstract

Cryptanalysis.

Time-bound key management

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. © 2006 IEEE.

Metrics

1 Record Views

Details

Title: On the security of an efficient time-bound hierarchical key management scheme
Creators - without role: Hung-Min Sun - Department of Computer Science , National Tsing Hua University
King-Hang Wang - National Tsing Hua University
Chien-Ming Chen - Department of Computer Science , National Tsing Hua University
Publication Details: IEEE Transactions on Dependable and Secure Computing, Vol.6(2), pp.159-160
Identifiers: 9957772610706774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Journal article

On the security of an efficient time-bound hierarchical key management scheme

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media