Abstract—Recently, Chien proposed a time-bound hierarchical key assignment scheme based on tamper-resistant devices, which improves the performance in terms of the computational efforts and the implementation costs. Later, Santis et al. demonstrated a collusion attack on Chien’s scheme to show that collusive malicious insiders can cooperatively derive some encryption keys and further proposed an improvement to eliminate the security flaws inherent in Chien’s scheme. In this paper, we will prove that Santis et al.’s key derivation is incorrect and their claimed security requirements cannot be achieved. On the other hand, we will further propose a new key derivation to improve the weakness in Santis et al., scheme.
Index Terms—Access control, cryptography, hierarchical key assignment.
Yu-Li Lin is with Ministry of Justice Investigation Bureau, New Taipei City 231, Taiwan (e-mail: andrina_lin@yahoo.com.tw).
Chien-Lung Hsu and Yu-Hao Chuang is with Department of Information Management, Chang-Gung University, Taiwan (e-mail: clhsu@mail.cgu.edu.tw, yuhao0512@gmail.com).
[PDF]
Cite: Yu-Li Lin, Chien-Lung Hsu, and Yu-Hao Chuang, "A Robust Time-Bound Hierarchical Key Assignment Scheme," International Journal of Future Computer and Communication vol. 3, no. 5, pp. 337-340, 2014.
