Towards optimal revocation and tracing schemes - The power of the ternary tree

Kazuhide Fukushima, Shinsaku Kiyomoto, Yutaka Miyake, Kouichi Sakurai

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

1 Citation (Scopus)

Abstract

Digital content distribution services require that 1) only valid user devices that has a valid key can decrypt the broadcasting content, 2) the keys can no longer be used to decrypt the content, if keys in a device are revealed, and 3) invalid users who illegally use keys in a device can be identified. This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. We design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. In our scheme, the number of labels stored in a client device can be reduced by about 20.4 percent and the average header length by up to 15.0 percent in the case where the total number of devices is 65,536. The efficiency of the traitor tracing is the same as the complete subtree method, and its computational cost imposed on a client device stays within O(logn). Our scheme is an improvement of the complete subtree and difference subset methods.

Original languageEnglish
Title of host publicationSECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography
Pages37-49
Number of pages13
Publication statusPublished - Sep 12 2011
EventInternational Conference on Security and Cryptography, SECRYPT 2011 - Seville, Spain
Duration: Jul 18 2011Jul 21 2011

Other

OtherInternational Conference on Security and Cryptography, SECRYPT 2011
CountrySpain
CitySeville
Period7/18/117/21/11

Fingerprint

Revocation
Tracing
Ternary
Labels
Broadcasting
Traitor Tracing
Cryptography
Percent
Valid
Broadcast Encryption
Costs
Content Distribution
Coalitions
Tree Structure
Computational Cost
Assignment
Cover
Subset

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Theoretical Computer Science

Cite this

Fukushima, K., Kiyomoto, S., Miyake, Y., & Sakurai, K. (2011). Towards optimal revocation and tracing schemes - The power of the ternary tree. In SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography (pp. 37-49)

Towards optimal revocation and tracing schemes - The power of the ternary tree. / Fukushima, Kazuhide; Kiyomoto, Shinsaku; Miyake, Yutaka; Sakurai, Kouichi.

SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. 2011. p. 37-49.

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

Fukushima, K, Kiyomoto, S, Miyake, Y & Sakurai, K 2011, Towards optimal revocation and tracing schemes - The power of the ternary tree. in SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. pp. 37-49, International Conference on Security and Cryptography, SECRYPT 2011, Seville, Spain, 7/18/11.
Fukushima K, Kiyomoto S, Miyake Y, Sakurai K. Towards optimal revocation and tracing schemes - The power of the ternary tree. In SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. 2011. p. 37-49
Fukushima, Kazuhide ; Kiyomoto, Shinsaku ; Miyake, Yutaka ; Sakurai, Kouichi. / Towards optimal revocation and tracing schemes - The power of the ternary tree. SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. 2011. pp. 37-49
@inproceedings{a0aba179cc094dd58af660e978699392,
title = "Towards optimal revocation and tracing schemes - The power of the ternary tree",
abstract = "Digital content distribution services require that 1) only valid user devices that has a valid key can decrypt the broadcasting content, 2) the keys can no longer be used to decrypt the content, if keys in a device are revealed, and 3) invalid users who illegally use keys in a device can be identified. This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. We design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. In our scheme, the number of labels stored in a client device can be reduced by about 20.4 percent and the average header length by up to 15.0 percent in the case where the total number of devices is 65,536. The efficiency of the traitor tracing is the same as the complete subtree method, and its computational cost imposed on a client device stays within O(logn). Our scheme is an improvement of the complete subtree and difference subset methods.",
author = "Kazuhide Fukushima and Shinsaku Kiyomoto and Yutaka Miyake and Kouichi Sakurai",
year = "2011",
month = "9",
day = "12",
language = "English",
isbn = "9789898425713",
pages = "37--49",
booktitle = "SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography",

}

TY - GEN

T1 - Towards optimal revocation and tracing schemes - The power of the ternary tree

AU - Fukushima, Kazuhide

AU - Kiyomoto, Shinsaku

AU - Miyake, Yutaka

AU - Sakurai, Kouichi

PY - 2011/9/12

Y1 - 2011/9/12

N2 - Digital content distribution services require that 1) only valid user devices that has a valid key can decrypt the broadcasting content, 2) the keys can no longer be used to decrypt the content, if keys in a device are revealed, and 3) invalid users who illegally use keys in a device can be identified. This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. We design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. In our scheme, the number of labels stored in a client device can be reduced by about 20.4 percent and the average header length by up to 15.0 percent in the case where the total number of devices is 65,536. The efficiency of the traitor tracing is the same as the complete subtree method, and its computational cost imposed on a client device stays within O(logn). Our scheme is an improvement of the complete subtree and difference subset methods.

AB - Digital content distribution services require that 1) only valid user devices that has a valid key can decrypt the broadcasting content, 2) the keys can no longer be used to decrypt the content, if keys in a device are revealed, and 3) invalid users who illegally use keys in a device can be identified. This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. We design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. In our scheme, the number of labels stored in a client device can be reduced by about 20.4 percent and the average header length by up to 15.0 percent in the case where the total number of devices is 65,536. The efficiency of the traitor tracing is the same as the complete subtree method, and its computational cost imposed on a client device stays within O(logn). Our scheme is an improvement of the complete subtree and difference subset methods.

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

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

M3 - Conference contribution

AN - SCOPUS:80052481035

SN - 9789898425713

SP - 37

EP - 49

BT - SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography

ER -