IEICE TRANSACTIONS on Fundamentals
Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption
Summary :
The complete subtree (CS) method is widely accepted for the broadcast encryption. A new method for assigning keys in the CS method is proposed in this paper. The essential idea behind the proposed method is to use two trapdoor permutations. Using the trapdoor information, the key management center computes and assigns a key to each terminal so that the terminal can derive all information necessary in the CS method. A terminal has to keep just one key, while log2 N + 1 keys were needed in the original CS method where N is the number of all terminals. The permutations to be used need to satisfy a certain property which is similar to but slightly different from the claw-free property. The needed property, named strongly semi-claw-free property, is formalized in terms of probabilistic polynomial time algorithm, and its relation to the claw-free property is discussed. It is also shown that if the used permutations fulfill the strongly semi-claw-free property, then the proposed method is secure against attacks of malicious users.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.2 pp.568-574
- Publication Date
- 2005/02/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.2.568
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ryo NOJIMA, Yuichi KAJI, "Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 2, pp. 568-574, February 2005, doi: 10.1093/ietfec/e88-a.2.568.
Abstract: The complete subtree (CS) method is widely accepted for the broadcast encryption. A new method for assigning keys in the CS method is proposed in this paper. The essential idea behind the proposed method is to use two trapdoor permutations. Using the trapdoor information, the key management center computes and assigns a key to each terminal so that the terminal can derive all information necessary in the CS method. A terminal has to keep just one key, while log2 N + 1 keys were needed in the original CS method where N is the number of all terminals. The permutations to be used need to satisfy a certain property which is similar to but slightly different from the claw-free property. The needed property, named strongly semi-claw-free property, is formalized in terms of probabilistic polynomial time algorithm, and its relation to the claw-free property is discussed. It is also shown that if the used permutations fulfill the strongly semi-claw-free property, then the proposed method is secure against attacks of malicious users.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.2.568/_p
Copy
@ARTICLE{e88-a_2_568,
author={Ryo NOJIMA, Yuichi KAJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption},
year={2005},
volume={E88-A},
number={2},
pages={568-574},
abstract={The complete subtree (CS) method is widely accepted for the broadcast encryption. A new method for assigning keys in the CS method is proposed in this paper. The essential idea behind the proposed method is to use two trapdoor permutations. Using the trapdoor information, the key management center computes and assigns a key to each terminal so that the terminal can derive all information necessary in the CS method. A terminal has to keep just one key, while log2 N + 1 keys were needed in the original CS method where N is the number of all terminals. The permutations to be used need to satisfy a certain property which is similar to but slightly different from the claw-free property. The needed property, named strongly semi-claw-free property, is formalized in terms of probabilistic polynomial time algorithm, and its relation to the claw-free property is discussed. It is also shown that if the used permutations fulfill the strongly semi-claw-free property, then the proposed method is secure against attacks of malicious users.},
keywords={},
doi={10.1093/ietfec/e88-a.2.568},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 568
EP - 574
AU - Ryo NOJIMA
AU - Yuichi KAJI
PY - 2005
DO - 10.1093/ietfec/e88-a.2.568
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2005
AB - The complete subtree (CS) method is widely accepted for the broadcast encryption. A new method for assigning keys in the CS method is proposed in this paper. The essential idea behind the proposed method is to use two trapdoor permutations. Using the trapdoor information, the key management center computes and assigns a key to each terminal so that the terminal can derive all information necessary in the CS method. A terminal has to keep just one key, while log2 N + 1 keys were needed in the original CS method where N is the number of all terminals. The permutations to be used need to satisfy a certain property which is similar to but slightly different from the claw-free property. The needed property, named strongly semi-claw-free property, is formalized in terms of probabilistic polynomial time algorithm, and its relation to the claw-free property is discussed. It is also shown that if the used permutations fulfill the strongly semi-claw-free property, then the proposed method is secure against attacks of malicious users.
ER -
English
