TY - JOUR
T1 - Regenerating code based secure distributed storage for wireless sensor networks
AU - Wu, Jun
AU - Dong, Mianxiong
AU - Ota, Kaoru
AU - Zhou, Zhenyu
N1 - Funding Information:
This work is partially supported by JSPS A3 Foresight Program and NEC C&C Foundation.
PY - 2013
Y1 - 2013
N2 - In certain wireless sensor network (WSN) scenarios the data fragments should be stored in a number of sensor nodes, and for the self-sustaining purposes, the storage should possess the ability to repair the lost fragment and to protect data secrecy. For achieving the above goals, we propose employment of the regenerating codes and symmetric-key encryption with a Blom based key management. Particularly note that the encoded blocks stored in the i-th node and originating from the j-th node are encrypted by symmetric key K ij. A common and desirable feature regarding the considered regenerating codes and Blom's key management scheme is that the both are based on employment of Vandermonde matrix, and accordingly yield a unified implementation framework. Preliminary consideration of the implementation complexity of the proposed scheme implies that the energy costs in the both cases, regarding the scenarios with and without the faults, are lower in comparison with related WSN schemes and accordingly suitable for applications related to resources-constrained WSNs. Resource consumption evaluations show the feasibility of the proposed scheme for WSNs. To our best knowledge, this paper is the first to realize the distributed storage with repair capability.
AB - In certain wireless sensor network (WSN) scenarios the data fragments should be stored in a number of sensor nodes, and for the self-sustaining purposes, the storage should possess the ability to repair the lost fragment and to protect data secrecy. For achieving the above goals, we propose employment of the regenerating codes and symmetric-key encryption with a Blom based key management. Particularly note that the encoded blocks stored in the i-th node and originating from the j-th node are encrypted by symmetric key K ij. A common and desirable feature regarding the considered regenerating codes and Blom's key management scheme is that the both are based on employment of Vandermonde matrix, and accordingly yield a unified implementation framework. Preliminary consideration of the implementation complexity of the proposed scheme implies that the energy costs in the both cases, regarding the scenarios with and without the faults, are lower in comparison with related WSN schemes and accordingly suitable for applications related to resources-constrained WSNs. Resource consumption evaluations show the feasibility of the proposed scheme for WSNs. To our best knowledge, this paper is the first to realize the distributed storage with repair capability.
KW - Blom
KW - Distributed storage
KW - Regenerating code
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=84896964502&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896964502&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2013.09.025
DO - 10.1016/j.procs.2013.09.025
M3 - Conference article
AN - SCOPUS:84896964502
VL - 21
SP - 183
EP - 190
JO - Procedia Computer Science
JF - Procedia Computer Science
SN - 1877-0509
T2 - 4th International Conference on Emerging Ubiquitous Systems and Pervasive Networks, EUSPN 2013 and the 3rd International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare, ICTH 2013
Y2 - 21 October 2013 through 24 October 2013
ER -