This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes
November/December 2011 (vol. 8 no. 6)
pp. 824-838
ASCII Text
x 
 
Levente Buttyán, László Czap, István Vajda, "Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 6, pp. 824-838, November/December, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TDSC.2010.36,
author = {Levente Buttyán and László Czap and István Vajda},
title = {Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes},
journal ={IEEE Transactions on Dependable and Secure Computing},
volume = {8},
number = {6},
issn = {1545-5971},
year = {2011},
pages = {824-838},
doi = {http://doi.ieeecomputersociety.org/10.1109/TDSC.2010.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Dependable and Secure Computing
TI - Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes
IS - 6
SN - 1545-5971
SP824
EP838
EPD - 824-838
A1 - Levente Buttyán,
A1 - László Czap,
A1 - István Vajda,
PY - 2011
KW - Network level security and protection
KW - sensor networks
KW - distributed data storage
KW - network coding
KW - pollution attack
KW - integrity protection.
VL - 8
JA - IEEE Transactions on Dependable and Secure Computing
ER -
 
Levente Buttyán, Budapest University of Technology and Economics, Budapest
László Czap, Budapest University of Technology and Economics, Budapest
István Vajda, Budapest University of Technology and Economics, Budapest
We address the problem of pollution attacks in coding-based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original data upon retrieval. We propose algorithms to detect and recover from such attacks. In contrast to existing approaches to solve this problem, our approach is not based on adding cryptographic checksums or signatures to the encoded packets, and it does not introduce any additional redundancy to the system. The results of our analysis show that our proposed algorithms are suitable for practical systems, especially in wireless sensor networks.

[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, “Network Information Flow,” IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] S.Y.R. Li, R.W. Yeung, and N. Cai, “Linear Network Coding,” IEEE Trans. Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[3] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Distributed Data Storage in Sensor Networks Using Decentralized Erasure Codes,” Proc. Asilomar Conf. Signals, Systems, and Computers, Nov. 2004.
[4] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Ubiquitous Access to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes,” Proc. Fourth Int'l Symp. Information Processing in Sensor Networks (IPSN '05), 2005.
[5] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Decentralized Erasure Codes for Distributed Networked Storage,” IEEE/ACM Trans. Networking, vol. 14, no. S1, pp. 2809-2816, June 2006.
[6] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Distributed Fountain Codes for Networked Storage,” Proc. IEEE Conf. Acoustics, Speech, and Signal Processing (ICASSP), 2006.
[7] C. Fragouli, J.-Y.L. Boudec, and J. Widmer, “Network Coding: An Instant Primer,” SIGCOMM Computer Comm. Rev., vol. 36, no. 1, pp. 63-68, 2006.
[8] L. Buttyán, L. Czap, and I. Vajda, “Securing Coding Based Distributed Storage in Wireless Sensor Networks,” Proc. IEEE Workshop Wireless and Sensor Network Security (WSNS), Oct. 2008.
[9] T. Ho, B. Leong, R. Kötter, M. Medard, M. Effros, and D. Karger, “Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding,” Proc. 2004 IEEE Int'l Symp. Information Theory (ISIT), Jun. 2004.
[10] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard, “Resilient Network Coding in the Presence of Byzantine Adversaries,” Proc. IEEE INFOCOM, pp. 616-624, 2007.
[11] R. Kötter and F.R. Kschischang, “Coding for Errors and Erasures in Random Network Coding,” Proc. IEEE Int'l Symp. Information Theory (ISIT), June 2007.
[12] R. Kötter and F.R. Kschischang, “Coding for Errors and Erasures in Random Network Coding,” IEEE Trans. Information Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
[13] M.N. Krohn, M.J. Freedman, and D. Mazieres, “On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution,” Proc. 2004 IEEE Symp. Security and Privacy, pp. 226-240, 2004.
[14] C. Gkantsidis and P.R. Rodriguez, “Network Coding for Large Scale Content Distribution,” Proc. IEEE INFOCOM, vol. 4, pp. 2235-2245, Mar. 2005.
[15] C. Gkantsidis and P. Rodriguez, “Cooperative Security for Network Coding File Distribution,” Proc. IEEE INFOCOM, 2006.
[16] K.E. Lauter, D.X. Charles, and K. Jain, “Signatures for Network Coding,” Proc. 40th Ann. Conf. Information Sciences and Systems (CISS '06), Mar. 2006.
[17] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, “An Efficient Signature-Based Scheme for Securing Network Coding against Pollution Attacks,” Proc. IEEE INFOCOM, 2008.
[18] F. Zhao, T. Kalker, M. Medard, and K.J. Han, “Signatures for Content Distribution with Network Coding,” Proc. 2007 IEEE Int'l Symp. Information Theory (ISIT '07), Jun. 2007.

Index Terms:
Network level security and protection, sensor networks, distributed data storage, network coding, pollution attack, integrity protection.
Citation:
Levente Buttyán, László Czap, István Vajda, "Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 6, pp. 824-838, Nov.-Dec. 2011, doi:10.1109/TDSC.2010.36
Usage of this product signifies your acceptance of the Terms of Use.