Abstract
Cloud storage system, which can be viewed as a large collection of individually unreliable storage nodes, is potential to be faced with the threat of data loss and leakage, due to node failure and eavesdropped by an intruder. As a solution, secret sharing scheme stores the data redundantly across the distributed storage system(DSS) and it is able to protect data security against ℓ-eavesdropper without need of secret key management mechanism, however, it do not provide regeneration property. Combining the regenerating code with the secret sharing scheme is an effective approach to address this drawback, yet all the schemes that have been proposed in previous work are conducted under the perfect-security criterion and leads to an unaffordable loss of the storage capacity while the number of observed nodes ℓ get close to threshold k. In this paper we adopt the weak-security criterion and give a formal description of “Secure DSS against an ℓ-eavesdropper”. Applying a secure hash function and concatenated with the Product-Matrix minimum bandwidth regenerating(PM-MBR) code, our scheme significantly improves the secrecy capacity and keeps the loss of data rate constantly in a low level with any ℓ. As the analysis result indicates, our scheme, which provides sufficient security, repair efficiency and storage efficiency, is more suitable for practical systems. Moreover, we introduce another approach as an extension, which combines the All-Or-Nothing Transform with PM-MBR, and finally achieves a secure storage against ℓ-eavesdropper without loss of data rate.
Chapter PDF
Similar content being viewed by others
Keywords
References
Dimakis, A.G., Godfrey, P.G., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network Coding for Distributed Storage Systems. IEEE Trans. on Information Theory 56, 4539–4551 (2010)
Suh, C., Ramchandran, K.: Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment. In: Proc. IEEE International Symposium on Information Theory (ISIT), Austin (2010)
Rashmi, K., Shah, N.B., Kumar, P.V.: Optimal Exact-regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. IEEE Trans. on Information Theory 57(8), 5227–5239 (2011)
Tamo, I., Wang, Z., Bruck, J.: Zigzag Codes: MDS Array Codes with Optimal Rebuilding. IEEE Trans. on Information Theory 59, 1597–1616 (2013)
Oliveira, P.F., Lima, L., Vinhoza, T.T.V., Barros, J., Médard, M.: Coding for Trusted Storage in Untrusted Networks. IEEE Trans. on Information Forensics and Security 7(6) (2012)
Bloch, M., Barros, J.: Physical-Layer Security: From Information Theory to Security Engeering. Cambridge Univ. Press, Cambridge (2011)
Oliveira, P.F., Lima, L., Vinhoza, T.T.V., Médard, M., Barros, J.: Trusted Storage Over Untrusted Networks. In: Proc. IEEE Global Communications Conference (GLOBECOM2010), Miami, FL (2010)
Yamamoto, H.: Secret Sharing System Using (k, l, n) Threshold Scheme. Electronics and Communications in Japan (Part I: Communications) 69, 46–54 (1986)
Bessani, A., Correia, M., Quaresma, B., André, F., Sousa, P.: DepSky: Dependable and Secure Storage in a Cloud-of-Clouds. In: Proc. EuroSys 2011, Salzburg, Austria (2011)
Krawczyk, H.: Secret Sharing Made Short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136–146. Springer, Heidelberg (1994)
Pawar, S., El Rouayheb, S., Ramchandran, K.: Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks. IEEE Trans. on Information Theory 57(10), 6734–6753 (2012)
Rawat, A.S., Koyluoglu, O.O., Silberstein, N., Vishwanath, S.: Optimal Locally Repairable and Secure Codes for Distributed Storage Systems. In arXiv:1210.6954 (2013)
Shah, N.B., Rashmi, K.V., Kumar, P.V.: Information-Theoretically Secure Regenerating Codes for Distributed Storage. In: Proc. IEEE Global Communications Conference, GLOBECOM (2011)
Kurihara, M., Kuwakado, H.: Secret sharing Schemes Based on Minimum Bandwidth Regenerating Codes. In: 2012 International Symposium on Information Theory and its Applications (ISITA), pp. 255–259 (2012)
Bhattad, K., Narayanan, K.R.: Weakly Secure Network Coding. In: Proc. First Workshop on Network Coding, Theory, and Applicat. (NetCod), Riva del Garda, Italy (2005)
Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612–613 (1979)
Rivest, R.L.: All-or-Nothing Encryption and the Package Transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210–218. Springer, Heidelberg (1997)
Stinson, D.R.: Something About All or Nothing (Transforms). Designs, Codes and Cryptography 22(2), 133–138 (2001)
Cui, T., Ho, T., Kliewer, J.: On Secure Network Coding Over Networks with Unequal Link Capacities and Restricted Wiretapping Sets. In: Proc. IEEE International Symposium on Information Theory, ISIT (2010)
Cai, N., Yeung, R.W.: Secure network coding. In: Proc. IEEE International Symposium on Information Theory (ISIT), Lausanne, Switzerland (2002)
El Rouayheb, S., Soljanin, E., Sprintson, A.: Secure network coding for wiretap networks of type II. IEEE Trans. on Information Theory 58(3), 1361–1371 (2012)
Luo, M.X., Yang, Y.X., et al.: Secure Network Coding Against Eavesdropper. Science In China Series F-Information Sciences 40(2), 371–380 (2010)
Adeli, M., Liu, H.: Secure Network Coding with Minimum Overhead Based on Hash Functions. IEEE Communications Letters 13(12), 956–958 (2009)
Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A Survey on Network Codes for Distributed Storage. Proceedings of the IEEE 99(3) (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, J., Wang, H., Xian, M., Huang, K. (2013). A Secure and Efficient Scheme for Cloud Storage against Eavesdropper. In: Qing, S., Zhou, J., Liu, D. (eds) Information and Communications Security. ICICS 2013. Lecture Notes in Computer Science, vol 8233. Springer, Cham. https://doi.org/10.1007/978-3-319-02726-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-02726-5_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02725-8
Online ISBN: 978-3-319-02726-5
eBook Packages: Computer ScienceComputer Science (R0)