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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.: Spins: security protocols for sensor networks. In: Proceedings of ACM Mobile Computing and Networking (Mobicom 2001), pp. 189–199 (2001)
Eschenauer, L., Gligor, V.: A Key-management Scheme for Distributed Sensor Networks. In: The 9th ACM Conference on Computer and Communications Security, pp. 41–47 (2002)
Liu, D., Ning, P.: Establishing Pairwise Keys in Distributed Sensor Networks. In: The 10th ACM Conference on Computer and Communcations Security, pp. 52–61 (2003)
Zhu, S., Setia, S., Jajodia, S.: LEAP: Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks. In: 10th ACM conference on Computer and Communications Security, pp. 62–72 (2003)
Karlof, C., Wagner, D.: Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures. In: 1st IEEE International Workshop Sensor Network Protocols and Applications, pp. 113–127 (2003)
Yin, C., Huang, S., Su, P., Gao, C.: Secure routing for large-scale wireless sensor networks. Communication Technology Proceedings 2, 1282–1286 (2003)
Demirkol, I., Alagoz, F., Delic, H., Ersoy, C.: Wireless Sensor Networks for Intrusion Detection: Packet Traffic Modeling. IEEE Communications Letters 10(1), 22–24 (2006)
Benson, Z., Freiling, F., Cholewinski, P.: Simple Evasive Data Storage in Sensor Networks. In: 17th IASTED International Conference on Parallel and Distributed Computing and Systems: First International Workshop on Distributed Algorithms and Applications for Wireless and Mobile Systems, pp. 779–784 (2005)
Kak, S.: On the method of puzzles for key distribution. International Journal of Computer and Information Science 14, 103–109 (1984)
Kak, S.: Exponentiation modulo a polynomial for data security. International Journal of Computer and Information Science 13, 337–346 (1983)
Shamir, A.: How to share a secret. Communication of ACM 22(11), 612–613 (1979)
Kak, S.: A cubic public-key transformation. Circuits, Systems and Signal Processing 26, 353–359 (2007)
Dickson, L.: Linear Groups with an Exposition of the Galois Field Theory. Dover Publications (1958)
Rosen, K.H.: Discrete Mathematics and its Applications. McGraw-Hill, New York (2007)
Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., Shenker, S.: DIFS: A Distributed Index for Features in Sensor Networks. Ad Hoc Networks 1, 333–349 (2003)
Subramanian, N., Yang, C., Zhang, W.: Securing distributed data storage and retrieval in sensor networks. Pervasive and Mobile Computing 3(6), 659–676 (2007)
Wang, G., Zhang, W., Cao, G., La Porta, T.: On supporting distributed collaboration in sensor networks. In: IEEE Military Communications Conference, vol. 2, pp. 752–757 (2003)
Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L.: A two-tier data dissemination model for large-scale wireless sensor networks. In: ACM International Conference on Mobile Computing and Networking, pp. 148–159 (2002)
Zhang, W., Cao, G., La Porta, T.: Data dissemination with ring-based index for sensor networks. In: IEEE International Conference on Network Protocol, pp. 305–314 (2003)
Renvall, A., Ding, C.: A nonlinear secret sharing scheme. In: Pieprzyk, J.P., Seberry, J. (eds.) ACISP 1996. LNCS, vol. 1172, pp. 56–66. Springer, Heidelberg (1996)
Bharucha-Reid, A.T., Sambandham, M.: Random Polynomials. Academic Press, New York (1986)
Parakh, A., Kak, S.: Internet Voting Protocol Based on Implicit Data Security. In: Proceedings of 17th International Conference on Computer Communications and Networks, ICCCN 2008, pp. 1–4 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Parakh, A., Kak, S. (2009). A Distributed Data Storage Scheme for Sensor Networks. In: Schmidt, A.U., Lian, S. (eds) Security and Privacy in Mobile Information and Communication Systems. MobiSec 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04434-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-04434-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04433-5
Online ISBN: 978-3-642-04434-2
eBook Packages: Computer ScienceComputer Science (R0)