Checking Only When It Is Necessary: Enabling Integrity Auditing Based on the Keyword With Sensitive Information Privacy for Encrypted Cloud Data

被引:47
作者
Gao, Xiang [1 ,2 ]
Yu, Jia [1 ,2 ]
Chang, Yan [3 ,4 ]
Wang, Huaqun [5 ]
Fan, Jianxi [6 ]
机构
[1] Qingdao Univ, Coll Comp Sci & Technol, Qingdao 266071, Peoples R China
[2] State Key Lab Cryptol, Beijing 100878, Peoples R China
[3] Chengdu Univ Informat Technol, Sch Cybersecur, Chengdu 610225, Peoples R China
[4] Adv Cryptog & Syst Secur Key Lab Sichuan Prov, Chengdu 610000, Peoples R China
[5] Nanjing Univ Posts & Telecommun, Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing 210023, Jiangsu, Peoples R China
[6] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Peoples R China
基金
中国国家自然科学基金;
关键词
Cryptography; Cloud computing; Indexes; Security; Privacy; Data privacy; Task analysis; Cloud storage; sensitive information privacy; keyword search; data auditing; privacy; SHARED DATA; SEARCH; SECURE; SQL;
D O I
10.1109/TDSC.2021.3106780
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The public cloud data integrity auditing technique is used to check the integrity of cloud data through the Third Party Auditor (TPA). In order to make it more practical, we propose a new paradigm called integrity auditing based on the keyword with sensitive information privacy for encrypted cloud data. This paradigm is designed for one of the most common scenario, that is, the user concerns the integrity of a portion of encrypted cloud files that contain his/her interested keywords. In our proposed scheme, the TPA who is only provided with the encrypted keyword, can audit the integrity of all encrypted cloud files that contain the user's interested keyword. Meanwhile, the TPA cannot deduce the sensitive information about which files contain the keyword and how many files contain this keyword. These salient features are realized by leveraging a newly proposed Relation Authentication Label (RAL). The RAL can not only authenticate the relation that files contain the queried keyword, but also be used to generate the auditing proof without sensitive information exposure. We give concrete security analysis showing that the proposed scheme satisfies correctness, auditing soundness and sensitive information privacy. We also conduct the detailed experiments to show the efficiency of our scheme.
引用
收藏
页码:3774 / 3789
页数:16
相关论文
共 49 条
[1]  
[Anonymous], 2012, The GNU Multiple Precision Complex Library
[2]  
[Anonymous], 2012, PROC NETW DISTRIB SY
[3]  
[Anonymous], 2020 THERE WILL BE 5
[4]  
[Anonymous], ENRON EMAIL DATASET
[5]  
Ateniese G., 2008, P 4 INT C SEC PRIV C, P1, DOI DOI 10.1145/1460877.1460889
[6]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[7]  
Bost R., 2016, 2016062 IACR
[8]  
Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75
[9]   Leakage-Abuse Attacks Against Searchable Encryption [J].
Cash, David ;
Grubbs, Paul ;
Perry, Jason ;
Ristenpart, Thomas .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :668-679
[10]   Dynamic Proofs of Retrievability Via Oblivious RAM [J].
Cash, David ;
Kupcu, Alptekin ;
Wichs, Daniel .
JOURNAL OF CRYPTOLOGY, 2017, 30 (01) :22-57