A Distributed Data Storage Scheme for Sensor Networks
Abhishek Parakh, Subhash Kak

TL;DR
This paper introduces a distributed data storage scheme for sensor networks that ensures data security and resilience by partitioning data into secure pieces distributed across sensors, preventing data compromise from sensor capture or failure.
Contribution
The scheme achieves encryption and distributed storage without keys, providing implicit security and fault tolerance in sensor networks.
Findings
Data can be reconstructed from a threshold number of pieces.
The scheme prevents data compromise from sensor capture or failure.
No encryption keys are needed for secure data partitioning.
Abstract
We present a data storage scheme for sensor networks that achieves the targets of encryption and distributed storage simultaneously. We partition the data to be stored into numerous pieces such that at least a specific number of them have to be brought together to recreate the data. The procedure for creation of partitions does not use any encryption key and the pieces are implicitly secure. These pieces are then distributed over random sensors for storage. Capture or malfunction of one or more (less than a threshold number of sensors) does not compromise the data. The scheme provides protection against compromise of data in specific sensors due to physical capture or malfunction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Energy Efficient Wireless Sensor Networks · Cryptography and Data Security
