Elliot Linzer, M. Vetterli
Computing
In [1], Tzeng proposed 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.
Elliot Linzer, M. Vetterli
Computing
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
G. Ramalingam
Theoretical Computer Science
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007