LIU Hongwei and CAO Wenming, “Public Proof of Cloud Storage from Lattice Assumption,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 186-190, 2014,
Citation: LIU Hongwei and CAO Wenming, “Public Proof of Cloud Storage from Lattice Assumption,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 186-190, 2014,

Public Proof of Cloud Storage from Lattice Assumption

Funds:  This work is supported by the National Natural Science Foundation of China (No.61001058, No.61171072), Projects in the National Science & Technology Pillar Program (No.2011BAH20B02, No.2011BAH20B03).
  • Received Date: 2012-12-01
  • Rev Recd Date: 2013-04-01
  • Publish Date: 2014-01-05
  • Cloud storage can provide flexible and scalable data storage services to users. However, once data is uploaded to the cloud without a copy in local computers, the user loses control of the data physically. So, it is necessary to study a method to ensure users' data integrity. Avoiding retrieving enormous storage data or checking the data by users, a proof of storage protocol with public auditing was proposed based on the lattice cryptography. The user computed the signatures of the blocks, and outsourced them to cloud servers. Cloud service providers combined the blocks. Third party auditor verified all blocks' integrity only through the combined message and signature. Based on the Small integer solution assumption, the presented protocol is secure against the lost attack and tamper attack from cloud service providers. Based on the Learning with error assumption, the presented protocol is secure against the curiosity attack from third party auditor. The protocol is quite efficient, requiring just a few matrix-vector multiplications and samplings from discrete Gaussians.
  • loading
  • H. Zhu, Z. Cao, W. Jia, A.V. Vasilakos,"SecCloud: Bridging secure storage and computation in cloud", 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops (ICDCSW), Macau, China, pp.52-61, 2010.
    Mahima Joshi, Yudhveer Singh Moudgil,"Secure cloud storage", International Journal of Computer Science & Communication Networks, Vol.1, No.2, pp.171-175, 2011.
    Amazon,"Amazon s3 availability event: July 20, 2008", Online at, 2008.
    H. Cheng, C. Rong, Z. Tan, Q. Zeng,"Identity based encryption and biometric authentication scheme for secure data access in cloud computing", Chinese Journal of Electronics, Vol.21, No.2, pp.254-259, 2012.
    K. Yang, X. Jia,"Data storage auditing service in cloud computing: Challenge, methods and opportunities", World Wide Web, Vol.15, No.4, pp.409-428, 2012.
    L. Chen,"A homomorphic hashing based provable data possession", Journal of Electronics and Information Technology, Vol.33, No.9, pp.2199-2204, 2011.
    L. Chen,"Using algebraic signatures to check data possession in cloud storage", Future Generation Computer Systems, Vol.29, No.7, pp.1709-1715, 2013.
    Q.Wang, C.Wang, J. Li, K. Ren, W. Lou,"Enabling public verifiability and data dynamics for storage security in cloud computing", The 14th European Symposium on Research in Computer Security, Saint Malo, France, pp.355-370, 2009.
    C.Wang, Q.Wang, K. Ren, W. Lou,"Privacy-preserving public auditing for data storage security in cloud computing", IEEE InfoCom2010, San Diego, CA, pp.1-9, 2010.
    C. Wang, K. Ren, W. Lou, J. Li,"Toward publicly auditable secure cloud data storage service", IEEE Network, Vol.24, No.4, pp.19-24, 2010.
    P. Zhang, J. Yu, T. Wang,"A homomorphic aggregate signature scheme based on lattice", Chinese Journal of Electronics, Vol.21, No.4, pp.701-704, 2012.
    C. Gentry, C. Peikert, V. Vaikuntanathan,"Trapdoors for hard lattices and new cryptographic constructions", Proceedings of the 40th annual ACM Symposium on Theory of Computing (STOC 2008), Victoria, British Columbia, Canada, pp.197-206, 2008.
    D. Boneh, D.M. Freeman,"Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures", Proceedings of PKC 2011, LNCS 6571, Berlin: Springer-Verlag, pp.1-16, 2011.
    D. Boneh, D.M. Freeman,"Homomorphic signatures for polynomial functions", Proceedings of EUROCRYPT 2011, LNCS 6632, Berlin: Springer-Verlag, pp.149-168, 2011.
    F.Wang, Y. Hu, B.Wang,"Lattice-based linearly homomorphic signature scheme over binary field", Science China Information Sciences, Vol.55, pp.1-9, 2012.
    V. Lyubashevsky, D. Micciancio,"Asymptotically efficient lattice-based digital signatures", Proceedings of TCC 2008, LNCS 4948, Berlin: Springer-Verlag, pp.37-54, 2008.
    W. Xu, D. Feng, J. Liu,"Public verifiable proof of storage protocol from lattice assumption", 2012 IEEE International Conference on Intelligent Control, Automatic Detection and High-End Equipment, Beijing, China, pp.133-137, 2012.
    O. Regev,"On lattices, learning with errors, random linear codes, and cryptography", Journal of the ACM (JACM), Vol.56, No.6, pp.1-40, 2009.
    V. Lyubashevsky,"Lattice signatures without trapdoors", Proceedings of EUROCRYPT 2012, LNCS 7237, Berlin: SpringerVerlag, pp.738-755, 2012.
  • 加载中


    通讯作者: 陈斌,
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (588) PDF downloads(2124) Cited by()
    Proportional views


    DownLoad:  Full-Size Img  PowerPoint