Improved subset difference method with ternary tree

Kazuhide Fukushima, Shinsaku Kiyomoto, Toshiaki Tanaka, Kouichi Sakurai

Research output: Contribution to journalArticle

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 number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65,536. On the other hand, the computational cost imposed on a client device stays within O(log n). Finally, we prove that the ternary SD method is secure against coalition attacks.

Original languageEnglish
Pages (from-to)2034-2044
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE93-A
Issue number11
DOIs
Publication statusPublished - Jan 1 2010

Fingerprint

Ternary
Difference Method
Labels
Coalitions
Subset
Attack
Percent
Revocation
Encryption
Cryptography
Computational Cost
Assignment
Cover
Evaluate
Costs
Simulation

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Improved subset difference method with ternary tree. / Fukushima, Kazuhide; Kiyomoto, Shinsaku; Tanaka, Toshiaki; Sakurai, Kouichi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E93-A, No. 11, 01.01.2010, p. 2034-2044.

Research output: Contribution to journalArticle

Fukushima, Kazuhide ; Kiyomoto, Shinsaku ; Tanaka, Toshiaki ; Sakurai, Kouichi. / Improved subset difference method with ternary tree. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2010 ; Vol. E93-A, No. 11. pp. 2034-2044.
@article{eb76df47614541d497a1e33fdbd18f90,
title = "Improved subset difference method with ternary tree",
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 number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65,536. On the other hand, the computational cost imposed on a client device stays within O(log n). 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 = "2010",
month = "1",
day = "1",
doi = "10.1587/transfun.E93.A.2034",
language = "English",
volume = "E93-A",
pages = "2034--2044",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

TY - JOUR

T1 - Improved subset difference method with ternary tree

AU - Fukushima, Kazuhide

AU - Kiyomoto, Shinsaku

AU - Tanaka, Toshiaki

AU - Sakurai, Kouichi

PY - 2010/1/1

Y1 - 2010/1/1

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 number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65,536. On the other hand, the computational cost imposed on a client device stays within O(log n). 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 number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65,536. On the other hand, the computational cost imposed on a client device stays within O(log n). Finally, we prove that the ternary SD method is secure against coalition attacks.

UR - http://www.scopus.com/inward/record.url?scp=78049520339&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049520339&partnerID=8YFLogxK

U2 - 10.1587/transfun.E93.A.2034

DO - 10.1587/transfun.E93.A.2034

M3 - Article

AN - SCOPUS:78049520339

VL - E93-A

SP - 2034

EP - 2044

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 11

ER -