Secure Distributed Storage for Bulk Data

  • Tadashi Minowa
  • Takeshi Takahashi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7667)


Distributed types of data storage techniques are important especially for the cases where data centers are compromised by big natural disasters or malicious users, or where data centers consist of nodes with low security and reliability. Techniques using secured distribution and Reed-Solomon coding have been proposed to cope with the above issue, but they are not efficient enough for dealing with big data in cloud computing in terms of return-on-investment. This paper proposes a secure distributed storage system architecture. It maintains high security level by using packaging techniques that need not require key management inherent in AES encryption. Moreover, it scales out so that it is capable of storing a large amount of data safely and securely. The performance of the architecture is also dealt with in terms of storage efficiency and security evaluation.


distributed storage cloud computing secret sharing network coding erasure codes 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Secure Hash Standard. National Institute of Standards and Technology, Washington, federal Information Processing Standard 180-2Google Scholar
  2. 2.
    Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. SIGCOMM Comput. Commun. Rev. 28, 56–67 (1998)CrossRefGoogle Scholar
  3. 3.
    Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: A distributed storage system for structured data. In: Proceedings of The 7th Conference on Usenix Symposium on Operating Systems Design And Implementation, vol. 7, pp. 205–218 (2006)Google Scholar
  4. 4.
    Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets. Journal of Network and Computer Applications 23, 187–200 (1999)CrossRefGoogle Scholar
  5. 5.
    Daemen, J., Rijmen, V.: The Design of Rijndael. Springer-Verlag New York, Inc., Secaucus (2002)zbMATHGoogle Scholar
  6. 6.
    Gallager, R.G.: Low-Density Parity-Check Codes (1963)Google Scholar
  7. 7.
    Krawczyk, H.: Secret Sharing Made Short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136–146. Springer, Heidelberg (1994)Google Scholar
  8. 8.
    Luby, M.: LT codes. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 271–280 (2002)Google Scholar
  9. 9.
    Mackay, D.J.C.: Fountain codes. IEE Communications 152, 1062–1068 (2005)CrossRefGoogle Scholar
  10. 10.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Code. North-Holland (1977)Google Scholar
  11. 11.
    MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes, 2nd edn. North-holland Publishing Company (1978)Google Scholar
  12. 12.
    McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583–584 (1981)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36, 335–348 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of the Society of Industrial and Applied Mathematics 8, 300–304 (1960)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Resch, J.K., Plank, J.S.: AONT-RS: Blending security and performance in dispersed storage systems. In: 9th USENIX Conference on File and Storage Technologies, FAST 2011, pp. 191–202 (2011)Google Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Tadashi Minowa
    • 1
  • Takeshi Takahashi
    • 1
  1. 1.National Institute of Information and Communications TechnologyTokyoJapan

Personalised recommendations