Revocation and tracing based on ternary tree: Towards optimal broadcast encryption scheme

Kazuhide Fukushima, Shinsaku Kiyomoto, Yutaka Miyake, Kouichi Sakurai

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

Abstract

This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. The subset difference method with ternary tree reduces the communication cost and tracing cost of the original method with the binary tree. However, straightforward expansion of the method ends in failure due to the vulnerability to coalition attacks. Thus, we design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. Our analysis on efficiency and security shows that our scheme is an improvement of the existing broadcast encryption schemes: complete subtree and subset difference methods.

Original languageEnglish
Title of host publicationE-Business and Telecommunications
Subtitle of host publicationInternational Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers
EditorsJose L. Sevillano, Joaquim Filipe
Pages233-248
Number of pages16
DOIs
Publication statusPublished - Dec 1 2012
Event8th International Joint Conference on e-Business and Telecommunications, ICETE 2011 - Seville, Spain
Duration: Jul 18 2011Jul 21 2011

Publication series

NameCommunications in Computer and Information Science
Volume314
ISSN (Print)1865-0929

Other

Other8th International Joint Conference on e-Business and Telecommunications, ICETE 2011
CountrySpain
CitySeville
Period7/18/117/21/11

Fingerprint

Broadcast Encryption
Revocation
Tracing
Ternary
Cryptography
Binary trees
Coalitions
Difference Method
Labels
Costs
Traitor Tracing
Subset
Communication
Communication Cost
Binary Tree
Tree Structure
Vulnerability
Assignment
Attack
Cover

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

Fukushima, K., Kiyomoto, S., Miyake, Y., & Sakurai, K. (2012). Revocation and tracing based on ternary tree: Towards optimal broadcast encryption scheme. In J. L. Sevillano, & J. Filipe (Eds.), E-Business and Telecommunications: International Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers (pp. 233-248). (Communications in Computer and Information Science; Vol. 314). https://doi.org/10.1007/978-3-642-35755-8_17

Revocation and tracing based on ternary tree : Towards optimal broadcast encryption scheme. / Fukushima, Kazuhide; Kiyomoto, Shinsaku; Miyake, Yutaka; Sakurai, Kouichi.

E-Business and Telecommunications: International Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers. ed. / Jose L. Sevillano; Joaquim Filipe. 2012. p. 233-248 (Communications in Computer and Information Science; Vol. 314).

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

Fukushima, K, Kiyomoto, S, Miyake, Y & Sakurai, K 2012, Revocation and tracing based on ternary tree: Towards optimal broadcast encryption scheme. in JL Sevillano & J Filipe (eds), E-Business and Telecommunications: International Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers. Communications in Computer and Information Science, vol. 314, pp. 233-248, 8th International Joint Conference on e-Business and Telecommunications, ICETE 2011, Seville, Spain, 7/18/11. https://doi.org/10.1007/978-3-642-35755-8_17
Fukushima K, Kiyomoto S, Miyake Y, Sakurai K. Revocation and tracing based on ternary tree: Towards optimal broadcast encryption scheme. In Sevillano JL, Filipe J, editors, E-Business and Telecommunications: International Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers. 2012. p. 233-248. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-35755-8_17
Fukushima, Kazuhide ; Kiyomoto, Shinsaku ; Miyake, Yutaka ; Sakurai, Kouichi. / Revocation and tracing based on ternary tree : Towards optimal broadcast encryption scheme. E-Business and Telecommunications: International Joint Conference, ICETE 2011 Seville, Spain, July 18-21, 2011 Revised Selected Papers. editor / Jose L. Sevillano ; Joaquim Filipe. 2012. pp. 233-248 (Communications in Computer and Information Science).
@inproceedings{7719a3b0b6a244c39730aa3b920daa71,
title = "Revocation and tracing based on ternary tree: Towards optimal broadcast encryption scheme",
abstract = "This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. The subset difference method with ternary tree reduces the communication cost and tracing cost of the original method with the binary tree. However, straightforward expansion of the method ends in failure due to the vulnerability to coalition attacks. Thus, we design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. Our analysis on efficiency and security shows that our scheme is an improvement of the existing broadcast encryption schemes: complete subtree and subset difference methods.",
author = "Kazuhide Fukushima and Shinsaku Kiyomoto and Yutaka Miyake and Kouichi Sakurai",
year = "2012",
month = "12",
day = "1",
doi = "10.1007/978-3-642-35755-8_17",
language = "English",
isbn = "9783642357541",
series = "Communications in Computer and Information Science",
pages = "233--248",
editor = "Sevillano, {Jose L.} and Joaquim Filipe",
booktitle = "E-Business and Telecommunications",

}

TY - GEN

T1 - Revocation and tracing based on ternary tree

T2 - Towards optimal broadcast encryption scheme

AU - Fukushima, Kazuhide

AU - Kiyomoto, Shinsaku

AU - Miyake, Yutaka

AU - Sakurai, Kouichi

PY - 2012/12/1

Y1 - 2012/12/1

N2 - This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. The subset difference method with ternary tree reduces the communication cost and tracing cost of the original method with the binary tree. However, straightforward expansion of the method ends in failure due to the vulnerability to coalition attacks. Thus, we design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. Our analysis on efficiency and security shows that our scheme is an improvement of the existing broadcast encryption schemes: complete subtree and subset difference methods.

AB - This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. The subset difference method with ternary tree reduces the communication cost and tracing cost of the original method with the binary tree. However, straightforward expansion of the method ends in failure due to the vulnerability to coalition attacks. Thus, we design a new cover-finding algorithm and label assignment algorithm in order to achieve a coalition-resistant revocation and tracing schemes. Our analysis on efficiency and security shows that our scheme is an improvement of the existing broadcast encryption schemes: complete subtree and subset difference methods.

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

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

U2 - 10.1007/978-3-642-35755-8_17

DO - 10.1007/978-3-642-35755-8_17

M3 - Conference contribution

AN - SCOPUS:84882273687

SN - 9783642357541

T3 - Communications in Computer and Information Science

SP - 233

EP - 248

BT - E-Business and Telecommunications

A2 - Sevillano, Jose L.

A2 - Filipe, Joaquim

ER -