This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Secure Decentralized Erasure Code for Distributed Networked Storage
November 2010 (vol. 21 no. 11)
pp. 1586-1594
ASCII Text
x 
 
Hsiao-Ying Lin, Wen-Guey Tzeng, "A Secure Decentralized Erasure Code for Distributed Networked Storage," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 11, pp. 1586-1594, November, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2010.27,
author = {Hsiao-Ying Lin and Wen-Guey Tzeng},
title = {A Secure Decentralized Erasure Code for Distributed Networked Storage},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {21},
number = {11},
issn = {1045-9219},
year = {2010},
pages = {1586-1594},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - A Secure Decentralized Erasure Code for Distributed Networked Storage
IS - 11
SN - 1045-9219
SP1586
EP1594
EPD - 1586-1594
A1 - Hsiao-Ying Lin,
A1 - Wen-Guey Tzeng,
PY - 2010
KW - Networked storage system
KW - distributed storage system
KW - decentralized erasure code
KW - threshold encryption
KW - security.
VL - 21
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Hsiao-Ying Lin, National Chiao Tung University, Hsinchu
Wen-Guey Tzeng, National Chiao Tung University, Hsinchu
Distributed networked storage systems provide the storage service on the Internet. We address the privacy issue of the distributed networked storage system. It is desired that data stored in the system remain private even if all storage servers in the system are compromised. The major challenge of designing these distributed networked storage systems is to provide a better privacy guarantee while maintaining the distributed structure. To achieve this goal, we introduce secure decentralized erasure code, which combines a threshold public key encryption scheme and a variant of the decentralized erasure code. Our secure distributed networked storage system constructed by the secure decentralized erasure code is decentralized, robust, private, and with low storage cost.

[1] J. Kubiatowicz, D. Bindel, Y. Chen, S.E. Czerwinski, P.R. Eaton, D. Geels, R. Gummadi, S.C. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B.Y. Zhao, "Oceanstore: An Architecture for Global-Scale Persistent Storage," Proc. Ninth Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), vol. 35, pp. 190-201, 2000.
[2] S.C. Rhea, C. Wells, P.R. Eaton, D. Geels, B.Y. Zhao, H. Weatherspoon, and J. Kubiatowicz, "Maintenance-Free Global Data Storage," IEEE Internet Computing, vol. 5, no. 5, pp. 40-49, Sept. 2001.
[3] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide Area Cooperative Storage with cfs," Proc. 18th Symp. Operating Systems Principles (SOSP), pp. 202-215, 2001.
[4] S. Acedański, S. Deb, M. Médard, and R. Keettor, "How Good Is Random Linear Coding Based Distributed Networked Storage," Proc. First Workshop Network Coding, Theory, and Applications— NetCod, 2005.
[5] C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. IEEE INFOCOM, vol. 4, pp. 2235-2245, 2005.
[6] 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, 2000.
[7] 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.
[8] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized Erasure Codes for Distributed Networked Storage," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2809-2816, June 2006.
[9] A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, "Proactive Secret Sharing or: How to Cope with Perpetual Leakage," Proc. 15th Ann. Int'l Cryptology Conf.—CRYPTO, pp. 339-352, 1995.
[10] C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl, "Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems," Proc. Ninth ACM Conf. Computer and Comm. Security (CCS), pp. 88-97, 2002.
[11] R. Canetti and S. Goldwasser, "An Efficient ıthreshold Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 90-106, 1999.
[12] D. Boneh, X. Boyen, and S. Halevi, "Chosen Ciphertext Secure Public Key Threshold Encryption without Random Oracles," Proc. Topics in Cryptology (CT-RSA), pp. 226-243, 2006.
[13] P.S.L.M. Barreto, B. Lynn, and M. Scott, "Efficient Implementation of Pairing-Based Cryptosystems," J. Cryptology, vol. 17, no. 4, pp. 321-334, 2004.
[14] V.S. Miller, "The Weil Pairing, and Its Efficient Calculation," J. Cryptology, vol. 17, no. 4, pp. 235-261, 2004.

Index Terms:
Networked storage system, distributed storage system, decentralized erasure code, threshold encryption, security.
Citation:
Hsiao-Ying Lin, Wen-Guey Tzeng, "A Secure Decentralized Erasure Code for Distributed Networked Storage," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 11, pp. 1586-1594, Nov. 2010, doi:10.1109/TPDS.2010.27
Usage of this product signifies your acceptance of the Terms of Use.