Cloud users store their data in the cloud environment which is privileged by the service provider. Cloud users can access their cloud storage. Here we propose a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computati...

The advent of smart phones has further expanded the horizon of communicative technologies. Now through the smart mobile devices, people can access and download the required data from the internet more conveniently. Many users might be interested in the same information at the same time from some hot spots. However, the respective base station may not be able to meet the demands of so many high-...

Cloud computing is a promising computing model that enables convenient and on-demand network access to a shared pool of configurable computing resources. The first offered cloud service is moving data into the cloud: data owners let cloud service providers host their data on cloud servers and data consumers can access the data from the cloud servers. This new paradigm of data storage service al...

The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been developed that can implement RAID-6; however, each has limitations. In this paper, we describe a new class of RAID-6 codes called the Liberation Codes. These codes encode, update and decode either optimally or close to optimal...

We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...

This paper investigates the use of redundancy and self repairing against node failures in distributed storage systems, using various strategies. In replication method, access to one replication node is sufficient to reconstruct a lost node, while in MDS erasure coded systems which are optimal in terms of redundancy-reliability tradeoff, a single node failure is repaired after recovering the ent...

Sensors require frequent over-the-air reprogramming to patch software errors, replace code, change sensor configuration, etc. Given their limited computational capability, one of the few workable techniques to secure code update in legacy sensors would be to execute Proofs of Secure Erasure (PoSE) which ensure that the sensor’s memory is purged before sending the updated code. By doing so, the ...

Data access performances over a Peer-to-Peer (P2P) network is a critical issue since downloading time remains the longest phase of P2P usage by end-user. In the present effort, we propose an innovative approach called PeerFecT (Peer-to-peer with Fec dissemination Technique) based on an erasure code, often called Forward Error Correction (FEC) code, to speed-up data access into P2P networks. The...

A procedure for suboptimizing the choice of convolution codes is described. It is known that random convolution codes that have been passed through a binary symmetric channel, or a binary erasure channel, have a low probability of error and are easily decoded, but no practical procedure for finding the optimum convolution code for long code lengths is known. A convolution code is defined by its...

Type parametrization is an essential construct in modern programming languages. On one hand, Java offers generics, on the other C++ templates for highly reusable code. The mechanism between these constructs differs and affects usage runtime performance, as well. uses type erasure, deals with instantiations.In this paper, we argue approach which similar to template construct. We evaluate perform...