This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy
July/August 2003 (vol. 15 no. 4)
pp. 1054-1055

Abstract—Tzeng proposes a time-bound cryptographic key assignment scheme for access control in a partial-order hierarchy. In this paper, we show that Tzeng's scheme is insecure against the collusion attack whereby three users conspire to access some secret class keys that they should not know according to Tzeng'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] R.L. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems Comm. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
[3] S.M. Yen and C.S. Laih, Fast Algorithms for LUC Digital Signature Computation Proc. IEEE Computers and Digital Technology, vol. 142, no. 2, pp. 165-169, 1995.

Index Terms:
Access control, key assignment, RSA, collusion attack.
Citation:
Xun Yi, Yiming Ye, "Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 1054-1055, July-Aug. 2003, doi:10.1109/TKDE.2003.1209023
Usage of this product signifies your acceptance of the Terms of Use.