A distributed data storage and retrieval scheme in unattended WSNs using homomorphic encryption and secret sharing

Authors:
Yi Ren;Vladimir Oleshchuk;Frank Y. Li
Affiliations:
Dept. of Information and Communication Technology, University of Agder, Grimstad, Norway;Dept. of Information and Communication Technology, University of Agder, Grimstad, Norway;Dept. of Information and Communication Technology, University of Agder, Grimstad, Norway
Venue:
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Year:
2009

Citing 7
Cited 0

Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
How to share a secret

Communications of the ACM
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
E.cient Aggregation of encrypted data in Wireless Sensor Networks

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Securing distributed data storage and retrieval in sensor networks

Pervasive and Mobile Computing
Catch Me (If You Can): Data Survival in Unattended Sensor Networks

PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Secure and efficient data storage in unattended wireless sensor networks

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security

Quantified Score

Hi-index	0.03

Visualization

Abstract

Many data storage schemes have been proposed in the past for keeping dependable data storage, but they are not designed for Unattended Wireless Sensor Networks (UWSNs). When applying these schemes to UWSNs, most of them have limitations such as high storage requirement, transmission cost, and not resilient to a large number of node compromises. To address the problem of data storage, transmission cost, and resilience of node compromise in UWSNs, we propose a novel Homomorphic Encryption and Homomorphic Secret Sharing based scheme (HEHSS) to accomplish the goals of confidentiality, resilience to node compromises, reliability, and efficiency of storage and transmission. Our scheme exploits the homomorphic secret sharing scheme to enable sensor nodes encode sensed data into several shares, and distribute them to their neighbors. This property allows the mobile sink to reconstruct data even if some of the shares stored in neighbors of a sensor are compromised. Detailed analysis has been conducted to evaluate the scheme in terms of efficiency and reliability.