Lattice-Based Privacy-Preserving and Forward-Secure Cloud Storage Public Auditing Scheme

被引:12
作者
Li, Haifeng [1 ]
Liu, Liangliang [2 ]
Lan, Caihui [3 ]
Wang, Caifen [4 ]
Guo, He [1 ]
机构
[1] Dalian Univ Technol, Sch Software, Dalian 116024, Peoples R China
[2] Shanghai Univ Int Business & Econ, Sch Stat & Informat, Shanghai 201620, Peoples R China
[3] Lanzhou City Univ, Sch Elect & Informat Engn, Lanzhou 730070, Peoples R China
[4] Shenzhen Technol Univ, Coll Big Data & Internet, Shenzhen 518118, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloud storage; public auditing; identity-based; lattice-assumptions; PROVABLE DATA POSSESSION; ATTRIBUTE-BASED ENCRYPTION; CHECKING;
D O I
10.1109/ACCESS.2020.2991579
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Aiming at reducing the local storage burden and computational costs, numerous individuals and enterprises are willing to outsource their data to the cloud server. Meanwhile, due to the loss of the actual physical control over their data files once outsourced to the cloud server, how to guarantee the cloud server keep user & x2019;s data integrity is an important security issue to be addressed urgently. Accordingly, multiple data integrity checking schemes based on the traditional cryptosystem have been proposed. However, with the advent and development of quantum computer, these existing data integrity checking schemes are no longer secure. Thus, it is necessary to study the new scheme which can resist quantum attack to adapt to the quantum era. In this work, we put forward a novel scheme named lattice-based privacy-preserving and forward-secure cloud storage public auditing scheme (LB-PPFS). Our proposed scheme is not only quantum-attack-against, but also enjoy the privacy-preserving and forward-secure property. In the proposed scheme, a curious auditor cannot learn any knowledge of user & x2019;s data because the original data is encapsulated with a random number. In addition, the lattice basis delegation technique is adopted to achieve forward security for resisting key exposure attack. Based on the hardness assumptions of SIS problem from lattice, we prove that the proposed scheme can achieve formally provable security. Besides, the theoretical analysis and performance evaluation demonstrate that the proposed scheme is effective and feasible to guarantee the quantum security for the data integrity in cloud storage.
引用
收藏
页码:86797 / 86809
页数:13
相关论文
共 38 条
[1]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[2]  
Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
[3]  
[Anonymous], 2009, Cryptology ePrint Archive, 2009/351
[4]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[5]  
Bellare M., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P431
[6]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6632, P149, DOI 10.1007/978-3-642-20465-4_10
[7]  
Cash D, 2010, LECT NOTES COMPUT SC, V6110, P523
[8]   A Public Auditing Protocol for Cloud Storage System With Intrusion-Resilience [J].
Ding, Ran ;
Xu, Yan ;
Cui, Jie ;
Zhong, Hong .
IEEE SYSTEMS JOURNAL, 2020, 14 (01) :633-644
[9]  
Gentry C, 2008, ACM S THEORY COMPUT, P197
[10]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178