Ternary subset difference method and its quantitative analysis

Kazuhide Fukushima, Shinsaku Kiyomoto, Toshiaki Tanaka, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInformation Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers
Pages225-239
Number of pages15
Volume5379 LNCS
DOIs
Publication statusPublished - Nov 9 2009
Event9th International Workshop on Information Security Applications, WISA 2008 - Jeju Island, Korea, Republic of
Duration: Sep 23 2008Sep 25 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5379 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Workshop on Information Security Applications, WISA 2008
CountryKorea, Republic of
CityJeju Island
Period9/23/089/25/08

Fingerprint

Quantitative Analysis
Ternary
Difference Method
Labels
Subset
Coalitions
Chemical analysis
Attack
Percent
Cryptography
Revocation
Encryption
Computational Cost
Assignment
Cover
Upper bound
Costs
Evaluate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Fukushima, K., Kiyomoto, S., Tanaka, T., & Sakurai, K. (2009). Ternary subset difference method and its quantitative analysis. In Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers (Vol. 5379 LNCS, pp. 225-239). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5379 LNCS). https://doi.org/10.1007/978-3-642-00306-6_17

Ternary subset difference method and its quantitative analysis. / Fukushima, Kazuhide; Kiyomoto, Shinsaku; Tanaka, Toshiaki; Sakurai, Kouichi.

Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers. Vol. 5379 LNCS 2009. p. 225-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5379 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fukushima, K, Kiyomoto, S, Tanaka, T & Sakurai, K 2009, Ternary subset difference method and its quantitative analysis. in Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers. vol. 5379 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5379 LNCS, pp. 225-239, 9th International Workshop on Information Security Applications, WISA 2008, Jeju Island, Korea, Republic of, 9/23/08. https://doi.org/10.1007/978-3-642-00306-6_17
Fukushima K, Kiyomoto S, Tanaka T, Sakurai K. Ternary subset difference method and its quantitative analysis. In Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers. Vol. 5379 LNCS. 2009. p. 225-239. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-00306-6_17
Fukushima, Kazuhide ; Kiyomoto, Shinsaku ; Tanaka, Toshiaki ; Sakurai, Kouichi. / Ternary subset difference method and its quantitative analysis. Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers. Vol. 5379 LNCS 2009. pp. 225-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6e5108946a70408190d9556c81028759,
title = "Ternary subset difference method and its quantitative analysis",
abstract = "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.",
author = "Kazuhide Fukushima and Shinsaku Kiyomoto and Toshiaki Tanaka and Kouichi Sakurai",
year = "2009",
month = "11",
day = "9",
doi = "10.1007/978-3-642-00306-6_17",
language = "English",
isbn = "3642003052",
volume = "5379 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "225--239",
booktitle = "Information Security Applications - 9th International Workshop, WISA 2008, Revised Selected Papers",

}

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/11/9

Y1 - 2009/11/9

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

SN - 3642003052

SN - 9783642003059

VL - 5379 LNCS

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

ER -