Skip to main content
SpringerLink
Log in

Provably secure cloud storage for mobile networks with less computation and smaller overhead

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Secure cloud storage (SCS) guarantees the data outsourced to the cloud to remain intact as it was before being outsourced. Previous schemes to ensure cloud storage reliability are either computationally heavy or admitting long overheads, thus are not suitable for mobile networks with strict computation/bandwidth restrictions. In this paper, we build an efficient SCS system for mobile networks based on homomorphic MAC and propose domain extension to enhance the security level and flexibility of the system. In addition, we give a formal security model which is compatible to previous ones and analyze our system in that model. We also give implementations on mobile devices to verify the effectiveness of our system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Deswarte Y, Quisquater J J, Saïdane A. Remote integrity checking—how to trust files stored on untrusted servers. In: Proceedings of Integrity and Internal Control in Information Systems VI - IFIP TC11/WG11.5 Sixth Working Conference on Integrity and Internal Control in Information Systems (IICIS), Lausanne, 2003. 1–11

    Google Scholar 

  2. Filho D, Barreto P. Demonstrating data possession and uncheatable data transfer. Cryptology ePrint Archive, Report 2006/150, 2006. http://eprint.iacr.org/

    Google Scholar 

  3. Naor M, Rothblum G N. The complexity of online memory checking. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Pittsburgh, 2005. 573–584

    Google Scholar 

  4. Schwarz T, Miller E. Store, forget, and check: using algebraic signatures to check remotely administered storage. In: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, Lisboa, 2006. 12

    Google Scholar 

  5. Ateniese G, Burns R C, Curtmola R, et al. Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, 2007. 598–609

    Google Scholar 

  6. Zhu Y, Wang H X, Hu Z X, et al. Efficient provable data possession for hybrid clouds. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, 2010. 756–758

    Google Scholar 

  7. Erway C, Küp¸cü A, Papamanthou C, et al. Dynamic provable data possession. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, Chicago, 2009. 213–222

    Google Scholar 

  8. Juels A, Kaliski B. Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, 2007. 584–597

    Google Scholar 

  9. Shacham H, Waters B. Compact proofs of retrievability. In: Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, Australia, 2008. 90–107

    MATH  Google Scholar 

  10. Xu J, Chang E. Towards efficient proofs of retrievability. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, Korea, 2012. 79–80

    Google Scholar 

  11. Ateniese G, Kamara S, Katz J. Proofs of storage from homomorphic identification protocols. In: Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2009), Tokyo, 2009. 319–333

    MATH  Google Scholar 

  12. Bowers K, Juels A, Oprea A. Proofs of retrievability: theory and implementation. In: Proceedings of the ACM Workshop on Cloud Computing Security, Chicago, 2009. 43–54

    Google Scholar 

  13. Dodis Y, Vadhan S, Wichs D. Proofs of retrievability via hardness amplification. In: Proceedings of the 6th Theory of Cryptography Conference (TCC 2009). Berlin: Springer, 2009. 109–127

    MATH  Google Scholar 

  14. Ateniese G, Pietro R, Mancini L, et al. Scalable and efficient provable data possession. In: Proceedings of the 4th International ICST Conference on Security and Privacy in Communication Networks (SecureComm 2008), Turkey, 2008. 1–10

    Google Scholar 

  15. Ma H, Zhang R. Secure cloud storage for dynamic group: how to achieve identity privacy-preserving and privilege control. In: Proceedings of the 9th International Conference Network and System Security. Berlin: Springer, 2015. 254–267

    Google Scholar 

  16. Wang Q, Wang C, Li J, et al. Enabling public verifiability and data dynamics for storage security in cloud computing. In: Proceedings of the 14th European Conference on Research in Computer Security, Saint-Malo, 2009. 355–370

    Google Scholar 

  17. Stefanov E, Dijk M, Juels A, et al. Iris: a scalable cloud file system with efficient integrity checks. In: Proceedings of the 28th Annual Computer Security Applications Conference (ACSAC 2012). New York: ACM, 2012. 229–238

    Google Scholar 

  18. Cash D, Küp¸cü A, Wichs D. Dynamic proofs of retrievability via oblivious RAM. In: Advances in Cryptology— EUROCRYPT 2013. Berlin: Springer, 2013. 279–295

    Book  Google Scholar 

  19. Shi E, Stefanov E, Papamanthou C. Practical dynamic proofs of retrievability. In: Proceedigns of ACM Conference on Computer and Communications Security (CCS 2013), Berlin, 2013. 325–336

    Google Scholar 

  20. Guan C, Ren K, Zhang F, et al. Symmetric-key based proofs of retrievability supporting public verification. In: Proceedigns of the 20th European Symposium on Research in Computer Security (ESORICS 2015). Berlin: Springer, 2015. 203–223

    Google Scholar 

  21. Lillibridge M, Elnikety S, Birrell A, et al. A cooperative internet backup scheme. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, San Antonio, 2003. 29–41

    Google Scholar 

  22. Wang C, Chow S, Wang Q, et al. Privacy-preserving public auditing for secure cloud storage. IEEE Trans Comput, 2013, 62: 362–375

    Article  MathSciNet  Google Scholar 

  23. Yang K, Jia X. An efficient and secure dynamic auditing protocol for data storage in cloud computing. IEEE Trans Parall Distrib Syst, 2013, 24: 1717–1726

    Article  Google Scholar 

  24. Chen F, Xiang T, Yang Y, et al. Secure cloud storage meets with secure network coding. In: Proceedings of Conference on Computer Communications, Canada, 2014. 673–681

    Google Scholar 

  25. Agrawal S, Boneh D. Homomorphic macs: mac-based integrity for network coding. In: Proceedings of the 7th International Conference on Applied Cryptography and Network Security, Paris-Rocquencourt, 2009. 292–305

    Google Scholar 

  26. Cheng C, Jiang T. A novel homomorphic MAC scheme for authentication in network coding. IEEE Commun Lett, 2011, 15: 1228–1230

    Article  Google Scholar 

  27. Shoup V. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332, 2004. http://eprint.iacr.org/

    Google Scholar 

  28. Krawczyk H. Cryptographic extraction and key derivation: the HKDF scheme. In: Proceedings of the 30th Annual Cryptology Conference (CRYPTO 2010). Berlin: Springer, 2010. 631–648

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by Strategic Priority Research Program of the Chinese Academy of Sciences (Grant Nos. XDA06010703, XDA06010701), National Natural Science Foundation of China (Grant Nos. 61472416, 61272478, 61632020), Foundation of Science and Technology on Information Assurance Laboratory (Grant No. KJ-14-002), and CREST, Japan Science and Technolegy Agency.

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Rui Zhang & Hui Ma

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Hui Ma

  3. Department of Complexity Science and Engineering, University of Tokyo, Kashwa City, Japan

    Yao Lu

  4. Oracle, Beijing, 100193, China

    Yang Li

Authors
  1. Rui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hui Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yao Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hui Ma.

Additional information

Amazon, http://status.aws.amazon.com/s3us-20080720.html and http://status.aws.amazon.com/s3-20080720.html.

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, R., Ma, H., Lu, Y. et al. Provably secure cloud storage for mobile networks with less computation and smaller overhead. Sci. China Inf. Sci. 60, 122104 (2017). https://doi.org/10.1007/s11432-016-0038-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-016-0038-6

Keywords

Search

Navigation