Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry

Hisashi MOHRI; Ritsuko MATSUMOTO; Yuichi KAJI

doi:10.1093/ietisy/e91-d.5.1416

Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry

Hisashi MOHRI, Ritsuko MATSUMOTO, Yuichi KAJI

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E91-D No.5 pp.1416-1423

Publication Date: 2008/05/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e91-d.5.1416

Type of Manuscript: Special Section PAPER (Special Section on Information and Communication System Security)

Category: Key Management

Cite this

Copy

Hisashi MOHRI, Ritsuko MATSUMOTO, Yuichi KAJI, "Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry" in IEICE TRANSACTIONS on Information, vol. E91-D, no. 5, pp. 1416-1423, May 2008, doi: 10.1093/ietisy/e91-d.5.1416.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.5.1416/_p

Copy

@ARTICLE{e91-d_5_1416,
author={Hisashi MOHRI, Ritsuko MATSUMOTO, Yuichi KAJI, },
journal={IEICE TRANSACTIONS on Information},
title={Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry},
year={2008},
volume={E91-D},
number={5},
pages={1416-1423},
abstract={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.},
keywords={},
doi={10.1093/ietisy/e91-d.5.1416},
ISSN={1745-1361},
month={May},}

Copy

TY - JOUR
TI - Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
T2 - IEICE TRANSACTIONS on Information
SP - 1416
EP - 1423
AU - Hisashi MOHRI
AU - Ritsuko MATSUMOTO
AU - Yuichi KAJI
PY - 2008
DO - 10.1093/ietisy/e91-d.5.1416
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2008
AB - 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.
ER -