Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes

Tomoyuki ASANO

doi:10.1093/ietfec/e88-a.1.203

Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes

Tomoyuki ASANO

Full Text Views

0

Cite this

Summary :

This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.1 pp.203-210

Publication Date: 2005/01/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.1.203

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Application

Cite this

Copy

Tomoyuki ASANO, "Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 1, pp. 203-210, January 2005, doi: 10.1093/ietfec/e88-a.1.203.
Abstract: This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.1.203/_p

Copy

@ARTICLE{e88-a_1_203,
author={Tomoyuki ASANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes},
year={2005},
volume={E88-A},
number={1},
pages={203-210},
abstract={This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.},
keywords={},
doi={10.1093/ietfec/e88-a.1.203},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 203
EP - 210
AU - Tomoyuki ASANO
PY - 2005
DO - 10.1093/ietfec/e88-a.1.203
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2005
AB - This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.
ER -