Dependable and Secure Data Storage in Wireless Ad Hoc Networks: An Assessment of DS2

Abstract

Abstract. DS2 is a dependable and secure data storage for mobile, wireless networks based on a peer-to-peer paradigm. DS 2 provides support to create and share files under a write-once model, and ensures data confidentiality and dependability by encoding files in a Redundant Residue Number System. The paper analyzes the code efficiency of DS 2 using a set of moduli allowing for efficient encoding and decoding procedures based on single precision arithmetic, and discusses the security issues. The comparison of DS 2 with the Information Dispersal Algorithm approach (IDA) shows that DS 2 features security features which are not provided by IDA, while the two approaches are comparable from the viewpoint of code efficiency and encoding/decoding complexity.

Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance

“…Due to these desirable properties, IDA has found its potential applications to secure and fault-tolerant storage and transmission of information. [Chessa et al 2004] further extended this idea and investigated the storage problem in the context of a redundant residue number system (RRNS) for encoding information, which aims to provide a dependable and secure data storage to mobile wireless networks. The idea of using number theoretic constructs for information dispersal can be traced back to Asmuth and Blakley [1982], who proposed an algorithm based on the Chinese Remainder theorem.…”

“…Data dependability is ensured since data can be reconstructed in the presence of up to s ≤ r residue erasures, combined with up to r−s 2 corrupted residues. It has been shown in Chessa et al [2004] that RRNS and IDA have comparable performance in terms of code efficiency and complexity; however, whether space efficiency can be obtained remains unclear. Another severe drawback of this approach is that, to reduce the computational overhead in the encoding and decoding process, the system has to maintain a large library of parameter values together with a big set of moduli.…”

“…Previous research on WSN security issues has been focused on network communication security, such as key management, message authentication, secure time synchronization and localization, and intrusion detection [Liu and Ning 2003;Perrig et al 2002;Ren et al 2006Ren et al , 2008Ren et al , 2009Wang et al 2010;Ye et al 2004]. Some related work [Chessa et al 2004;Girao et al 2007;Ma and Tsudik 2007;Pietro et al 2008;Subbiah and Blough 2005;Subramanian et al 2007;Zhang et al 2005] regarding secure distributed data storage can be found in the literature, but none of it satisfies the overall requirements of data confidentiality, dependability, integrity, and efficiency. Pietro et al [2008] suggested moving the stored data constantly among sensors to increase dependability of one particular data item.…”

“…Rabin [1989] proposed an information dispersal algorithm (IDA) for secure data storage and transmission in distributed systems, where the original information F is dispersed into n by using erasure codes. Chessa et al [2004] extended the idea of information dispersal in Rabin [1989], and investigated the data storage problem in the context of a redundant residue number system (RRNS). However, the system has to maintain a large library of parameters together with a big set of moduli.…”