A Lightweight Tree Based One-Key Broadcast Encryption Scheme

Tomoyuki ASANO; Kazuya KAMIO

doi:10.1093/ietfec/e89-a.7.2019

A Lightweight Tree Based One-Key Broadcast Encryption Scheme

Tomoyuki ASANO, Kazuya KAMIO

Full Text Views

0

Cite this

Summary :

Broadcast encryption technology enables a sender to send information securely to a group of receivers excluding specified receivers over a broadcast channel. In this paper, we propose a new key-tree structure based on Rabin cryptosystem, and an access control scheme using the structure. We show the security of the access control scheme and construct a new broadcast encryption scheme based on it. The proposed broadcast encryption scheme is a modification of the complete subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some modifications of the complete subtree method which minimize the number of keys for a receiver to one, and the most efficient one among them with respect to the computational overhead at receivers is based on RSA cryptosystem. The computational overhead at receivers in our scheme is around log₂e times smaller than the most efficient previously proposed one, where e is a public exponent of RSA, and the proposed scheme is the most efficient among tree based one-key schemes. This property is examined by experimental results. Our scheme achieves this reduction in the computational overhead in exchange for an increase in the size of nonsecret memory by [log n * few (e.g. eight)] bits, where n is the total number of receivers.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.7 pp.2019-2028

Publication Date: 2006/07/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.7.2019

Type of Manuscript: PAPER

Category: Information Security

Cite this

Copy

Tomoyuki ASANO, Kazuya KAMIO, "A Lightweight Tree Based One-Key Broadcast Encryption Scheme" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 7, pp. 2019-2028, July 2006, doi: 10.1093/ietfec/e89-a.7.2019.
Abstract: Broadcast encryption technology enables a sender to send information securely to a group of receivers excluding specified receivers over a broadcast channel. In this paper, we propose a new key-tree structure based on Rabin cryptosystem, and an access control scheme using the structure. We show the security of the access control scheme and construct a new broadcast encryption scheme based on it. The proposed broadcast encryption scheme is a modification of the complete subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some modifications of the complete subtree method which minimize the number of keys for a receiver to one, and the most efficient one among them with respect to the computational overhead at receivers is based on RSA cryptosystem. The computational overhead at receivers in our scheme is around log₂e times smaller than the most efficient previously proposed one, where e is a public exponent of RSA, and the proposed scheme is the most efficient among tree based one-key schemes. This property is examined by experimental results. Our scheme achieves this reduction in the computational overhead in exchange for an increase in the size of nonsecret memory by [log n * few (e.g. eight)] bits, where n is the total number of receivers.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.7.2019/_p

Copy

@ARTICLE{e89-a_7_2019,
author={Tomoyuki ASANO, Kazuya KAMIO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Lightweight Tree Based One-Key Broadcast Encryption Scheme},
year={2006},
volume={E89-A},
number={7},
pages={2019-2028},
abstract={Broadcast encryption technology enables a sender to send information securely to a group of receivers excluding specified receivers over a broadcast channel. In this paper, we propose a new key-tree structure based on Rabin cryptosystem, and an access control scheme using the structure. We show the security of the access control scheme and construct a new broadcast encryption scheme based on it. The proposed broadcast encryption scheme is a modification of the complete subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some modifications of the complete subtree method which minimize the number of keys for a receiver to one, and the most efficient one among them with respect to the computational overhead at receivers is based on RSA cryptosystem. The computational overhead at receivers in our scheme is around log₂e times smaller than the most efficient previously proposed one, where e is a public exponent of RSA, and the proposed scheme is the most efficient among tree based one-key schemes. This property is examined by experimental results. Our scheme achieves this reduction in the computational overhead in exchange for an increase in the size of nonsecret memory by [log n * few (e.g. eight)] bits, where n is the total number of receivers.},
keywords={},
doi={10.1093/ietfec/e89-a.7.2019},
ISSN={1745-1337},
month={July},}

Copy

TY - JOUR
TI - A Lightweight Tree Based One-Key Broadcast Encryption Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2019
EP - 2028
AU - Tomoyuki ASANO
AU - Kazuya KAMIO
PY - 2006
DO - 10.1093/ietfec/e89-a.7.2019
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2006
AB - Broadcast encryption technology enables a sender to send information securely to a group of receivers excluding specified receivers over a broadcast channel. In this paper, we propose a new key-tree structure based on Rabin cryptosystem, and an access control scheme using the structure. We show the security of the access control scheme and construct a new broadcast encryption scheme based on it. The proposed broadcast encryption scheme is a modification of the complete subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some modifications of the complete subtree method which minimize the number of keys for a receiver to one, and the most efficient one among them with respect to the computational overhead at receivers is based on RSA cryptosystem. The computational overhead at receivers in our scheme is around log₂e times smaller than the most efficient previously proposed one, where e is a public exponent of RSA, and the proposed scheme is the most efficient among tree based one-key schemes. This property is examined by experimental results. Our scheme achieves this reduction in the computational overhead in exchange for an increase in the size of nonsecret memory by [log n * few (e.g. eight)] bits, where n is the total number of receivers.
ER -