Authors:
Deepak Kumar Dalai
1
and
Pinaki Sarkar
2
Affiliations:
1
National Institute of Science Education and Research, India
;
2
Indian Institute of Science, India
Keyword(s):
Partial Spread, Net, Combinatorial Designs, Key Predistribution Scheme, Distributed Sensor Networks.
Related
Ontology
Subjects/Areas/Topics:
Applications and Uses
;
Applied Cryptography
;
Cryptographic Techniques and Key Management
;
Cryptography
;
Data Engineering
;
Databases and Data Security
;
Defense and Security
;
Information and Systems Security
;
Internet Technology
;
Sensor Networks
;
Web Information Systems and Technologies
;
Web Security and Privacy
Abstract:
Key management is an essential functionality for developing secure cryptosystems; particularly for implementations
to low cost devices of a distributed sensor networks (DSN)–a prototype of Internet of Things (IoT).
Low cost leads to constraints in various resources of constituent devices of a IoT (sensors of a DSN); thereby
restricting implementations of computationally heavy public key cryptosystems. This leads to adaptation of
the novel key predistribution trick in symmetric key platform to efficiently tackle the problem of key management
for these resource starved networks. After a few initial proposals based on random graphs, most
key predistribution schemes (KPS) use deterministic (combinatorial) approaches to assure essential design
properties. Combinatorial designs like a (v;b; r;k)configuration which forms a μ(v;b; r;k)CID are effective
schemes to design KPS (Lee and Stinson, 2005). A net in a vector space is a set of cosets of certain kind of
subspaces called partial spr
ead. A μ(v;b; r;k)CID can be formed from a net. In this paper, we propose a key
predistribution scheme for DSN, named as sensornet, using net. Effectiveness of sensornet in term of crucial
metrics in comparison to other prominent schemes has been theoretically established.
(More)