Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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 log_2N+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.
- 社団法人電子情報通信学会の論文
- 2005-02-01
著者
-
Kaji Yuichi
Graduate School Of Information Science Nara Institute Of Science And Technology
-
NOJIMA Ryo
Graduate School of Information Science, Nara Institute of Science and Technology
-
Nojima Ryo
Graduate School Of Information Science Nara Institute Of Science And Technology
関連論文
- On the Minimum Weight of Simple Full-Length Array LDPC Codes
- Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
- RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY
- Syntactic Unification Problems under Constrained Substitutions
- Two-dimensional barcode system with extreme density : some investigation on the error correcting mechanism
- Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method(Application)(Cryptography and Information Security)
- Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
- Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption(Information Security)
- Maximum Likelihood Decoding for Linear Block Codes Using Grobner Bases
- A Soft-Decision MLD Algorithm for Linear Block Codes Using Grobner Bases
- Decoding Linear Block Codes Using the Ordered Statistics and MLD Techniques
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code(Information Theory)
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Linear Block Code
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
- Encoding LDPC Codes Using the Triangular Factorization(Coding Theory,Information Theory and Its Applications)
- The Expected Write Deficiency of Index-Less Indexed Flash Codes
- Uniform-Compartment Flash Code and Binary-Indexed Flash Code
- Flash Code Utilizing Binary-Indexed Slice Encoding and Resizable-Clusters
- Multi-Mode Encoding with Binary-Indexed Flash Code