A secure decentralized erasure code for distributed networked storage

IEEE Transactions on Parallel and Distributed Systems

Volumn 21, Issue 11, 2010, Pages 1586-1594

  Lin, Hsiao Ying ^a   Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

decentralized erasure code; distributed storage system; Networked storage system; security.; threshold encryption

Indexed keywords

DECENTRALIZED ERASURE CODES; DISTRIBUTED STORAGE SYSTEM; SECURITY.; STORAGE SYSTEMS; THRESHOLD ENCRYPTION;

DISTRIBUTED COMPUTER SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

DATA STORAGE EQUIPMENT;

EID: 77957752994     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2010.27     Document Type: Article

References (14)

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. Acedanski, S. Deb, M. Medard, 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, RW. 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. (Pubitemid 43898929)
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 ithreshold 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.