A Lightweight Tree Based One-Key Broadcast Encryption Scheme(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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_2e 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 [logn^* few (e.g. eight)] bits, where n is the total number of receivers.
- 一般社団法人電子情報通信学会の論文
- 2006-07-01
著者
関連論文
- Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes(Application)(Cryptography and Information Security)
- A Lightweight Tree Based One-Key Broadcast Encryption Scheme(Information Security)