Research On Structured Encryption Based On Graph Structure And Range Query

The advent of the big data era has led to more and more data that we need to process and analyze.It is difficult for users and enterprises to effectively manage and analyze these data locally.With the maturity of cloud computing technology,more and more users and enterprises choose to upload data to cloud servers to reduce the pressure on local servers.Cloud servers can provide users with huge storage space and efficient processors,and users only need to pay a small amount of money to enjoy these services.In order to ensure user privacy and security,a common processing method is to encrypt data and upload it to the server.However,the ciphertext obtained through traditional encryption technology loses the characteristics of plaintext,and users cannot perform operations such as query on encrypted data.In order to solve this problem,searchable encryption technology(SSE)was proposed.Searchable encryption technology and structured encryption technology(STE)have always been one of the current research hotspots.However,the leaks in searchable encryption schemes have always plagued scholars.Because of these leaks,attackers can easily break the encryption schemes to obtain users’ private information.In response to these problems,this article has done the following:(1)A Privacy-Protected Dynamic Graph Encryption Scheme for Social Networks is proposed.We have designed a new dynamic graph structure encryption scheme,which can implement node or edge update operations.In the process of updating the node,our method can hide the graph structure information of the new node from the server.Moreover,our scheme can effectively implement keyword queries(including single-keyword and multikeyword searches)and neighbor queries.At the same time,in each query process,the query algorithm introduces random errors into the query results to hide the user’s access pattern from the server and reduce information leakage.Our scheme can effectively resist query recovery attacks(such as IKK attacks and Count attacks),especially for the most powerful attack against dynamic searchable encryption schemes-file injection attacks.Finally,we conducted a safety analysis and efficiency analysis of the program.(2)A Leakage-Suppressed Range Query Scheme for Structured Data in Io T proposed.We turn the comparison between values into the problem of the intersection of two string sets.This scheme does not leak the size of the attribute value and the size relationship between the attribute values.At the same time,the relationship between the attribute value and the trapdoor is also hidden.After the data comparison is completed,the server only knows whether the attribute value meets the range query requirements,and will not obtain any other information.Second,we propose a random query trapdoor generation algorithm.In the process of generating trap gates,we introduce a random number,which makes the trap gates generated multiple times using this algorithm for the same query different.This can hide the user’s search pattern from the server,so that the server cannot deceive the user,nor can it obtain additional useful information.We defined the leakage level of this scheme and proved the safety of the scheme under the premise of this leakage.Finally,we analyzed the efficiency of the scheme.