Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method(Application)(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
The complete subtree (CS) method is one of the most well-known broadcast encryptions which do not enforce the receivers to keep "online." This paper is to reduce the size of secret information which must be stored in a terminal of the method. In the original CS method, the size of the secret information increases as the number of terminals increases. It is shown in this paper that, by making use of a one-way trapdoor permutation, we can make the size constant regardless of the number of terminals. The security of the proposed scheme is investigated, and detailed comparison with other similar schemes is presented. The proposed scheme is suitable for practical implementations of the CS method.
- 社団法人電子情報通信学会の論文
- 2005-01-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 R
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