Ternary subset difference method and its quantitative analysis

Kazuhide Fukushima, Shinsaku Kiyomoto, Toshiaki Tanaka, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)


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.

ホスト出版物のタイトルInformation Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers
出版ステータス出版済み - 2009
イベント9th International Workshop on Information Security Applications, WISA 2008 - Jeju Island, 大韓民国
継続期間: 9 23 20089 25 2008


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5379 LNCS


その他9th International Workshop on Information Security Applications, WISA 2008
CityJeju Island

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)


「Ternary subset difference method and its quantitative analysis」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。