Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management
作者机构:Security DivisionResearch Center for Scientific and Technical InformationAlgiers 16028Algeria Laboratory of Research in Artificial IntelligenceDepartment of Computer ScienceUniversity of Sciences and Technology H Suari B oumedieneAlgiers 16111Algeria The Insight CentreUnversity College DublinDublinDO4 VIW8Ireland
出 版 物:《Journal of Computer Science & Technology》 (计算机科学技术学报(英文版))
年 卷 期:2019年第34卷第1期
页 面:133-154页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学]
主 题:searchable encryption cloud computing homomorphic encryption attributeqbased encryption inverted index
摘 要:Cloud computing is a technology that provides users with a large storage space and an enormous computing ***,the outsourced data are often sensitive and confidential,and hence must be encrypted before being ***,classical search approaches have become obsolete and new approaches that are compatible with encrypted data have become a *** privacy reasons,most of these approaches are based on the vector model which is a time consuming process since the entire index must be loaded and exploited during the search process given that the query vector must be compared with each document *** solve this problem,we propose a new method for constructing a secure inverted index using two key techniques,homomorphic encryption and the dummy documents ***,1)homomorphic encryption generates very large ciphertexts which are thousands of times larger than their corresponding plaintexts,and 2)the dummy documents technique that enhances the index security produces lots of false positives in the search *** proposed approach exploits the advantages of these two techniques by proposing two methods called the compressed table of encrypted scores and the double score ***,we exploit a second secure inverted index in order to manage the users access rights to the ***,in order to validate our approach,we performed an experimental study using a data collection of one million *** experiments show that our approach is many times faster than any other approach based on the vector model.