Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes

Buttyán, Levente; Czap, L.; Vajda, István

doi:10.1109/tdsc.2010.36

Cited by 19 publications

(20 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [3] the authors consider random coding-based cloud storage and devise both a pollution detection algorithm and four identification and repair algorithms to recover the original data. The algorithms represent trade-offs between computational and communication complexity and successful identification (and repair) probability.…”

Section: Related Workmentioning

confidence: 99%

“…• the work in [3] exploits coding in GF (q) with very large q to assume one extra coded fragment is enough to detect pollution, i.e., the pollution detection algorithm is assumed to be perfect. Conversely, we base our work on an imperfect pollution detection algorithm (see Alg.…”

Section: Related Workmentioning

confidence: 99%

“…4) that stems from the use of LT codes based on simple XOR combinations (q = 2), and of small values of the coding block length k (that are preferred in the context we consider for the sake of performance and availability [2]). The imperfection of the pollution detection algorithms forced us to develop a more complex approach with respect to [3] because we simply cannot trust the (imperfect) detection mechanism to draw conclusions on the status of the system of equations. All algorithms in [3] would be more complex if an imperfect pollution detection mechanism had to be adopted;…”

Section: Related Workmentioning

confidence: 99%

“…The imperfection of the pollution detection algorithms forced us to develop a more complex approach with respect to [3] because we simply cannot trust the (imperfect) detection mechanism to draw conclusions on the status of the system of equations. All algorithms in [3] would be more complex if an imperfect pollution detection mechanism had to be adopted;…”

Section: Related Workmentioning

confidence: 99%

“…Conversely, the detection algorithm in [3] works right after the system of linear equations is solved. Alg.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

Securing Coding-Based Cloud Storage Against Pollution Attacks

Anglano

Gaeta

Grangetto

2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-The widespread diffusion of distributed and cloud storage solutions has changed dramatically the way users, system designers, and service providers manage their data. Outsourcing data on remote storage provides indeed many advantages in terms of both capital and operational costs. The security of data outsourced to the cloud, however, still represents one of the major concerns for all stakeholders. Pollution attacks, whereby a set of malicious entities attempt to corrupt stored data, are one of the many risks that affect cloud data security. In this paper we deal with pollution attacks in coding-based block-level cloud storage systems, i.e. systems that use linear codes to fragment, encode, and disperse virtual disk sectors across a set of storage nodes to achieve desired levels of redundancy, and to improve reliability and availability without sacrificing performance. Unfortunately, the effects of a pollution attack on linear coding can be disastrous, since a single polluted fragment can propagate pervasively in the decoding phase, thus hampering the whole sector. In this work we show that, using rateless codes, we can design an early pollution detection algorithm able to spot the presence of an attack while fetching the data from cloud storage during the normal disk reading operations. The alarm triggers a procedure that locates the polluting nodes using the proposed detection mechanism along with statistical inference. The performance of the proposed solution is analyzed under several aspects using both analytical modelling and accurate simulation using real disk traces. Our results show that the proposed approach is very robust and is able to effectively isolate the polluters, even in harsh conditions, provided that enough data redundancy is used.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…Conversely, the detection algorithm in [3] works right after the system of linear equations is solved. Alg.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Securing Coding-Based Cloud Storage Against Pollution Attacks

Anglano

Gaeta

Grangetto

2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

Detouring dynamic routing holes in stationary wireless sensor networks in the presence of temporarily misbehaving nodes

Kar

Misra

2015

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this work, we propose a scheme, named BRIDGE, to bypass dynamic routing holes arising in stationary wireless sensor networks in the presence of temporarily misbehaving nodes such as dumb [1,2] or transfaulty nodes. The affected nodes behave normally after the resumption of favorable environmental conditions. Therefore, both dumb and transfaulty behaviors of sensor nodes are dynamic in nature. The nodes in these networks get temporarily isolated from the network, when they behave as dumb or transfaulty. Because of the presence of nodes with such behavior, dynamic communication holes may occur in the network, which are formed or removed and thus increase or decrease in size with time. Connectivity re-establishment procedures can mitigate holes by re-connecting isolated nodes with the network after activating the intermediate sleep nodes, adjusting the communication range of intermediate nodes, or by using an alternative communication mode. However, such procedures cannot always re-establish connectivity because of the lack of neighbor nodes in reduced or adjusted communication range. Therefore, routing schemes using greedy forwarding approaches need to bypass holes to avoid the data packets from getting stuck at the boundary nodes and efficiently delivering them to the sink. However, the existing hole avoidance schemes consider holes as static. The proposed scheme, BRIDGE, detects hole boundary and bypasses routing traffics in the dynamic hole scenario. In the proposed scheme, a boundary node selects the next hop based on the minimum distance from all the neighbor nodes to the destination node, although this minimum distance is more than the distance to the destination from the node itself. Simulation results show that the performance of the proposed scheme degrades with the increase in hole area.

show abstract