Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
スポンサーリンク
概要
- 論文の詳細を見る
This study is to investigate new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to predistribute cryptographic keys in sensor nodes before they are deployed. A focal point in this solution is the choice of keys that are assigned to a sensor node. Eschenauer et al. considered to choose keys randomly, and Chan et al. also followed the random choice approach. We consider in this paper a new approach in which keys are assigned according to a basic algebraic geometry. The performance of the proposed scheme is investigated analytically.
- (社)電子情報通信学会の論文
- 2008-05-01
著者
-
Kaji Yuichi
Graduate School Of Information Science Nara Institute Of Science And Technology
-
MOHRI Hisashi
Graduate School of Information Science, Nara Institute of Science and Technology
-
MATSUMOTO Ritsuko
Graduate School of Information Science, Nara Institute of Science and Technology
-
Matsumoto Ritsuko
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Mohri Hisashi
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
- New certificate chain discovery methods for trust establishment in ad hoc networks and their evaluation (特集:次世代社会基盤をもたらす高度交通システムとモバイル通信システム)
- 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
- New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation
- Multi-Mode Encoding with Binary-Indexed Flash Code
- New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation