Xinrui Ge

Xinrui Ge

Auto-generated profile, based on publicly available information

Xinrui Ge

College of Computer Science and Technology, Qingdao University, Qingdao, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 January 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XGXinrui Ge
Xinrui Ge
JYJia Yu
Jia Yu
Hanlin ZhangHanlin Zhang
Hanlin Zhang
CHChengyu Hu
Chengyu Hu
Zengpeng LiZengpeng Li
Zengpeng Li
RHRong Hao
Rong Hao
Verifiable Searchable Symmetric Encryption, as an important cloud security technique, allows users to retrieve the encrypted data from the cloud through keywords and verify the validity of the returned results. Dynamic update for cloud data is one of the most common and fundamental requirements for data owners in such schemes. To the best of our knowledge, the existing verifiable SSE schemes supporting data dynamic update are all based on asymmetric-key cryptography verification, which involves time-consuming operations. The overhead of verification may become a significant burden due to the sheer amount of cloud data. Therefore, how to achieve keyword search over dynamic encrypted cloud data with efficient verification is a critical unsolved problem. To address this problem, we explore achieving keyword search over dynamic encrypted cloud data with symmetric-key based verification and propose a practical scheme in this paper. In order to support the efficient verification of dynamic data, we design a novel Accumulative Authentication Tag (AAT) based on the symmetric-key cryptography to generate an authentication tag for each keyword. Benefiting from the accumulation property of our designed AAT, the authentication tag can be conveniently updated when dynamic operations on cloud data occur. In order to achieve efficient data update, we design a new secure index composed by a search table ST based on the orthogonal list and a verification list VL containing AATs. Owing to the connectivity and the flexibility of ST, the update efficiency can be significantly improved. The security analysis and the performance evaluation results show that the proposed scheme is secure and efficient.

16 May 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XGXinrui Ge
Xinrui Ge
JYJia Yu
Jia Yu
RHRong Hao
Rong Hao
Graph matching, as one of the most fundamental problems in graph database, has a wide range of applications. Due to the large scale of graph database and the hardness of graph matching, it is an attractive alternative to make use of the cloud to store massive data graphs and conduct the complex graph matching. To protect the privacy, data graphs are usually encrypted before being outsourced to the cloud. A few schemes have been proposed to support graph matching query over encrypted graphs. However, none of them can realize efficient subgraph extraction when the matched subgraph needs to be exactly located at the data graph. The graph user has to perform the complex subgraph isomorphism operation to extract the isomorphic subgraph from the matched data graph in state-of-the-art schemes. The time complexity of judging subgraph isomorphism is $O(n!n^{2})$ at most, where $n$ is the number of vertices in the data graph. In order to solve this problem, we propose a privacy-preserving graph matching query scheme supporting quick subgraph extraction in this paper. In our design, two non-colluding cloud servers are adopted to accomplish the matching operation jointly. Neither of them can infer the plaintexts of graphs. The first cloud server can prune some impossible matched vertices from the data graph, and get a possible matched matrix to represent which vertices in the data graph might match with the vertices in the query graph. The second cloud server performs the related matrix operations based on its stored information and the information sent by the first cloud server. The two cloud servers jointly verify the correctness of the matched matrix. The graph user can directly and quickly extract the matrix of the subgraph isomorphic to the query graph from the data graph matrix based on the matched matrix, and further recover this subgraph. No subgraph isomorphism operation is involved in the procedure of subgraph extraction for the graph user. The time complexity of subgraph extraction is $O(m^{2})$ in our scheme, where $m$ is the number of vertices in the query graph. The extensive experiments with real-world database demonstrate the efficiency of the proposed privacy-preserving graph matching scheme.

9 November 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
XGXinrui Ge
Xinrui Ge
JYJia Yu
Jia Yu
RHRong Hao
Rong Hao
HLHaibin Lv
Haibin Lv
With the integration of the healthcare system, Internet of Things, and cloud storage service, more and more medical institutions upload their electronic medical records (EMRs) to the cloud to reduce the local storage burden and realize data sharing among external researchers. To secure the sensitive information, EMRs usually should be encrypted before being stored on the cloud. However, the existing searchable encryption schemes that encrypt the entire EMRs can hide the sensitive information, but this results in the shared EMRs being unable to be used by researchers. In addition, if the queried and extracted EMRs are incorrect, it will lead to misdiagnosis and even endanger the patient’s life. In order to solve the aforementioned problems, in this article, we propose a verifiable keyword search scheme supporting sensitive information hiding for the cloud-based healthcare sharing system. The sensitive information is encrypted, while other contents in EMR can be shared among users in this scheme. Doctors and researchers can quickly perform search operations based on keywords to extract the EMRs they require. This time complexity is $O(n)$ , where $n$ is the number of attribute values in the record. But the sensitive information is hidden for the researchers. Furthermore, the correctness of EMRs can be verified when they are extracted from the cloud. This time complexity is max $\lbrace O(n^{\prime }),O(N^{\prime })\rbrace$ , where $n^{\prime }$ is the number of query keywords and $N^{\prime }$ is the number of the retrieved records. We expound the security and carry out experiments to estimate the efficiency of the proposed scheme.

26 April 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
XGXinrui Ge
Xinrui Ge
JYJia Yu
Jia Yu
Hanlin ZhangHanlin Zhang
Hanlin Zhang
JBJianli Bai
Jianli Bai
JFJianxi Fan
Jianxi Fan
Neal XiongNeal Xiong
Neal Xiong
In recent years, Industrial Internet of Things (IIoT) has gradually attracted the attention of the industry owing to its accurate time synchronization, communication accuracy, and high adaptability. As an important data structure, graphs are widely used in IIoT applications, where entities and their relationships can be expressed in the form of graphs. With the widespread adoption of IIoT and cloud computing, an increasing number of individuals or organizations are outsourcing their IIoT graph data to cloud servers to enjoy the unlimited storage space and fast computing service. To protect the privacy of graph data, graphs are usually encrypted before being outsourced. In this article, we propose a search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT. To realize search pattern privacy, we adopt two noncolluded cloud servers to accomplish different tasks. We leverage the first server to store the encrypted data and perform query operations, and use the second one to rerandomize the contents and shuffle the locations of the queried records. Before queries, we generate the trapdoors by using different random numbers. After queries, we ask the second server to rerandomize the contents of the records that the first server touched. In addition, we shuffle the physical locations of original records by inserting some fake records. In this way, all contents and physical locations of the touched records change, so that the first server cannot distinguish whether two queries are the same or not. To enhance the efficiency on the user side, we further improve this system by moving some heavy workloads from the user to the cloud. The security analysis and the performance evaluation show that our work is secure and efficient.

4 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XGXinrui Ge
Xinrui Ge
JYJia Yu
Jia Yu
FCFei Chen
Fei Chen
FKFanyu Kong
Fanyu Kong
CLChangfeng Li
Changfeng Li
Phrase search encryption, as an important technique in cloud-based IoT system, allows users to retrieve encrypted IoT data that contains a set of consecutive keywords. It plays an important role in cloud-based e-healthcare diagnosis system, machine learning applications for cloud-based IoT system, etc. However, to the best of our knowledge, the existing phrase search encryption schemes cannot achieve the complete verification for search results. They either cannot verify whether the returned files correctly containing the query phrase or cannot verify whether all files containing this query phrase are returned. Result verification is very important for some cloud-based IoT applications. If the search result is incorrect in the cloud-based e-healthcare diagnosis system, it will lead to misdiagnosis even endanger the patient’s life. In order to deal with this problem, this article explores how to achieve verifiable phrase search over encrypted cloud-based IoT data. Specifically, we design novel look-up tables which can be utilized to determine and verify the position relationship among keywords. Meanwhile, we adopt a two-phase query strategy. In the first query phase, the data user can know the identifiers of files containing the keywords in the query phrase, and generate the search trapdoor based on these identifiers for the next phase. In the second query phase, the data user can obtain the verification information to check whether all files containing the query phrase are correctly returned. We present the security analysis of our scheme and conduct extensive experiments. The results prove the high security and efficiency of our proposed scheme.

1 December 2021 in Computers & Security
Verified
Journal Article
Closed access
FSFangyuan Sun
Fangyuan Sun
JYJia Yu
Jia Yu
XGXinrui Ge
Xinrui Ge
MYMing Yang
Ming Yang
FKFanyu Kong
Fanyu Kong