Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
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.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
B. Wagle
EJOR
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013