Research On Top-K Dynamic Search Validation Based On Untrusted Cloud

Big data has become a hot topic in many fields.Cloud platforms with absolute advantages are increasingly being applied to big data processing and analysis data.Existing research suggests encrypting data before outsourcing and adopting Searchable Symmetric Encryption(SSE)to facilitate keyword-based searches on the ciphertexts.However,no prior SSE constructions can simultaneously achieve sublinear search time,efficient update and verification,and on-demand file retrieval,which are essential to the development of big data.In order to fulfill the above three points,the main research contents of this paper are as follows:First of all,in order to enable SSE to be effectively updated and verified,and more suitable for cloud computing,we propose a dynamic verifiable SSE scheme(DVSSEs).The scheme uses a reverse index and an RSA accumulator to enable users to search and update files in a verifiable manner.Specifically,DVSSEs is constructed in two different ways.The basic DVSSEs is built based on merle-hashing-Tree(MHT)and BLS signatures,which can easily be extended from the DVSSE.Due to the high cost of basic DVSSEs during the update phase,the advanced DVSSEs uses random permutation and RSA accumulators to improve performance.Then,the SSE scheme for dynamic update/verification satisfies the requirement of returning on-demand queries for Top-K encrypted documents.Based on the DVSSES scheme,we propose a Top-K Ranking Dynamic Verifiable SSE(RDVSSE)scheme.The program allows users to perform Top-K searches in dynamic file collections while effectively validating search results.The RDVSSE scheme is based on an inverted index,which is a valid index structure and implements a keyword-to-document mapping relationship.At the same time,according to the weight relationship between the inverted search keyword and the file,a file ranking linked list is established,and a Top-K document for on-demand query is realized.For the design of the verifiable part,the verification of the data matrix is based on the verification matrix and the RSA accumulator.Finally,the article has completed the improvement of the program and designed a reasonable experimental program.Experimental results show that the DVSSEs and RDVSSE schemes respectively satisfy the sub-linear search time,effective update,verification,and on-demand file retrieval performance.The RDVSSE scheme has better performance in saving overhead.