TY - GEN
T1 - Ternary subset difference method and its quantitative analysis
AU - Fukushima, Kazuhide
AU - Kiyomoto, Shinsaku
AU - Tanaka, Toshiaki
AU - Sakurai, Kouichi
PY - 2009
Y1 - 2009
N2 - This paper proposes a ternary subset difference method (SD method) that is resistant to coalition attacks. In order to realize a secure ternary SD method, we design a new cover-finding algorithm, label assignment algorithm, and encryption algorithm. These algorithms are required to revoke one or two subtrees simultaneously while maintaining resistance against coalition attacks. We realize this two-way revocation mechanism by creatively using labels and hashed labels. Then, we evaluate the efficiency and security of the ternary SD method. We show that the upper bound of the average message length in the ternary SD method is smaller by about 12.2 percent than that of the conventional SD method, and the number of labels on each client device can be reduced by about 20.4 percent. On the other hand, the computational cost imposed on a client device stays within O(logn). Finally, we prove that the ternary SD method is secure against coalition attacks.
AB - This paper proposes a ternary subset difference method (SD method) that is resistant to coalition attacks. In order to realize a secure ternary SD method, we design a new cover-finding algorithm, label assignment algorithm, and encryption algorithm. These algorithms are required to revoke one or two subtrees simultaneously while maintaining resistance against coalition attacks. We realize this two-way revocation mechanism by creatively using labels and hashed labels. Then, we evaluate the efficiency and security of the ternary SD method. We show that the upper bound of the average message length in the ternary SD method is smaller by about 12.2 percent than that of the conventional SD method, and the number of labels on each client device can be reduced by about 20.4 percent. On the other hand, the computational cost imposed on a client device stays within O(logn). Finally, we prove that the ternary SD method is secure against coalition attacks.
UR - http://www.scopus.com/inward/record.url?scp=70350635688&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350635688&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-00306-6_17
DO - 10.1007/978-3-642-00306-6_17
M3 - Conference contribution
AN - SCOPUS:70350635688
SN - 3642003052
SN - 9783642003059
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 225
EP - 239
BT - Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers
T2 - 9th International Workshop on Information Security Applications, WISA 2008
Y2 - 23 September 2008 through 25 September 2008
ER -