IEICE TRANSACTIONS on Fundamentals
Improved Subset Difference Method with Ternary Tree
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.2034-2044
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.2034
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuhide FUKUSHIMA, Shinsaku KIYOMOTO, Toshiaki TANAKA, Kouichi SAKURAI, "Improved Subset Difference Method with Ternary Tree" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 2034-2044, November 2010, doi: 10.1587/transfun.E93.A.2034.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.2034/_p
Copy
@ARTICLE{e93-a_11_2034,
author={Kazuhide FUKUSHIMA, Shinsaku KIYOMOTO, Toshiaki TANAKA, Kouichi SAKURAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improved Subset Difference Method with Ternary Tree},
year={2010},
volume={E93-A},
number={11},
pages={2034-2044},
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.},
keywords={},
doi={10.1587/transfun.E93.A.2034},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Improved Subset Difference Method with Ternary Tree
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2034
EP - 2044
AU - Kazuhide FUKUSHIMA
AU - Shinsaku KIYOMOTO
AU - Toshiaki TANAKA
AU - Kouichi SAKURAI
PY - 2010
DO - 10.1587/transfun.E93.A.2034
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
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.
ER -
English
