Abstract
In unattended wireless sensor networks (UWSNs), sensed data are stored locally or at designated nodes and further accessed by authorized collectors on demand. This paradigm is motivated by certain scenarios where historical or digest data (e.g., average temperature in a day), instead of real-time data, are of interest. The data are not instantly forwarded to a central sink upon sensing, thereby saving communication energy for transmission. Such a paradigm can also improve data survivability by making use of distributed data storage in cheap flash memory on nodes. However, the security and dependability of such data storage are critical for the future data accessibility in UWSNs. To address this issue, we propose a secure and dependable distributed storage scheme for UWSNs. Our scheme takes advantages of both secret sharing and Reed-Solomon code, which can achieve computational security and maintain low communication overhead in terms of shortened data dispersing size. We also propose a general coding method to publicly verify data integrity in a distributed manner, with low communication and storage overhead, and without the need of holding original data. The extensive analysis justifies that our scheme can provide secure, dependable and publicly verifiable distributed data storage in UWSNs even in the presence of node compromise and Byzantine failure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Thuraisingham B. Secure sensor information management and mining. Signal Process Mag IEEE, 2004, 21: 14–19
Pietro R D, Mancini L V, Soriente C, et al. Catch me (if you can): Data survival in unattended sensor networks. In: Proc. of 6th Annual IEEE International Conference on Pervasive Computing and Communications (PerCom’08), Hong Kong, China, 2008. 185–194
Diao Y, Ganesan D, Mathur G, et al. Rethinking data management for storage-centric sensor networks. In: Proc. of the Third Biennial Conference on Innovative Data Systems Research (CIDR’07), Asilomar, CA, 2007. 22–31
Girao J, Westhoff D, Mykletun E, et al. Tinypeds: Tiny persistent encrypted data storage in asynchronous wireless sensor networks. Ad Hoc Networks, Elesevier, 2007, 5: 1073–1089
Zeinalipour-Yazti D, Kalogeraki V, Gunopulos D, et al. Towards in-situ data storage in sensor databases. In: Proc. of 10th Panhellenic Conference on Informatics (PTI’05), LNCS 3746, Volos Greece, 2005. 36–46
Osrovsky R, Yung M. How to withsand mobile virus attack. In: Proc. of PODC, Montreal, Quebec, Canada, 1991. 51–59
Ma D, Soriente C, Tsudik G. New adversary and new threats: Security in unattended sensor networks. IEEE Network, 2009, 23: 43–48
Ma D, Tsudik G. Forward-secure sequential aggregate authentication. In: IEEE Symposium on Security and Privacy (IEEE S&P’07), Oakland, May 2007. 86–91
Ganesan D, Greenstein B, Estrin D, et al. Multiresolution storage and search in sensor networks. ACM Trans Stor, 2005, 1: 277–315
Mathur G, Desnoyers P, Ganesan D, et al. Ultra-low power data storage for sensor networks. In: Proc. of the Fifth International Conference on Information Processing in Sensor Networks (IPSN’06), Nashville, Tennessee, USA, 2006. 374–381
Banerjee A, Mitra A, Naijar W, et al. Rise-co-s: High performance sensor storage and co-processing architecture. In: Proc. of Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Natowkrs, (SECON’05), Santa Clara, California, 2005. 1–12
Blundo C, Santix A D, Herzberg A, et al. Perfectly-secure key distribution for dynamic conferences. In: Proc. of CRYPTO’92, Santa Barbara, California, USA, 1992. 471–486
Bhatnagar N, Miller E L. Designing a secure reliable file system for sensor networks. In: Proc. of the 2007 ACM Workshop on Storage Security and Survivability (Storage’07), Alexandria, Virginia, 2007
Girod L, Lukac M, Trifa V, et al. The design and implementation of a self-calibrating distributed acoustic sensing platform. In: Proc. of ACM SenSys’06, Baulder Colorado, USA, 2006
Inel corporation. Intel mote 2. http://www.intel.com/research/.
Shamir A. How to share a secret. Comm ACM, 1979, 22: 612–613
Reed S, Solomon G. Polynomial codes over certain finite. J Soc Indust Appl Math, 1960, 8: 300–304
Lou W, Liu W, Fang Y. Spread: Enhancing data confidentiality in mobile and hoc networks. In: Proc. of IEEE INFOCOM’04, Hong Kong, China, 2004. 2404–2413
Cachin C, Tessaro S. Optimal resilience for erasure-coded byzantine distributed storage. In: Proc. of Dependable Systems and Networks (DSN’06), Washington, DC, USA, 2006. 115–124
Aguilera M K, Janakiraman R, Xu L. Using erasure codes efficiently for storage in a distributed systems. In: Proc. of DSN’05, Palo Alto, CA, USA, 2005. 336–345
Belenkiy M. Disjunctive multi-level secret sharing. Cryptology ePrint Archive, Report 2008/018, 2008, http://eprint.iacr.org/
Benaloh J. Secret sharing homomorphisms: keeping shares of a secret secret. In: Proc. of Crypto’86, Santa Barbara, California, USA, 1987. 251–260
Plank J S. Fast galois field arithmetic library in c/c++. Tech. Report UT-CS-07-593, 2007
Greenan K M, Miller E L, Schwarz T. Analysis and construction of galois fields for efficient storage reliability. Tech. Report Number SSRC-07-09, UCSC, Storage Systems Research Center, August 2007
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ren, W., Ren, Y. & Zhang, H. Secure, dependable and publicly verifiable distributed data storage in unattended wireless sensor networks. Sci. China Inf. Sci. 53, 964–979 (2010). https://doi.org/10.1007/s11432-010-0096-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-0096-7