This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Security of Chien's Efficient Time-Bound Hierarchical Key Assignment Scheme
September 2005 (vol. 17 no. 9)
pp. 1298-1299
Recently, Chien proposed a time-bound hierarchical key assignment scheme based on tamper-resistant devices. Without public key cryptography, Chien's scheme greatly reduces computation load and implementation cost. In this paper, we show that Chien's scheme is insecure against a collusion attack whereby three users conspire to access some secret class keys that they should not know according to Chien's scheme.

[1] W.G. Tzeng, “A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 1, pp. 182-188, Jan./Feb. 2002.
[2] X. Yi and Y. Ye, “Security Analysis of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 1054-1055, July/Aug. 2003.
[3] H.Y. Chien, “Efficient Time-Bound Hierarchical Key Assignment Scheme,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 10, pp. 1301-1304, Oct. 2004.

Index Terms:
Index Terms- Cryptography, hierarchical key assignment.
Citation:
Xun Yi, "Security of Chien's Efficient Time-Bound Hierarchical Key Assignment Scheme," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 9, pp. 1298-1299, Sept. 2005, doi:10.1109/TKDE.2005.152
Usage of this product signifies your acceptance of the Terms of Use.