Wenju Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenju Xu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
6 shared publications - Wei Zhao
National Key Laboratory of Security Communication, China Electronic Science and Technology Group Corporation, Chengdu, China
3 shared publications - Xin Li
No. 30 Institute of China Electronics Technology Group Corporation
3 shared publications - Yupu Hu
Xidian University
3 shared publications - Dianhua Tang
Key Laboratory of Science and Technology on Communication Security, The 30th Research Institute of China Electronic Technology Group Corporation, Chengdu, China
2 shared publications - Yu Zhan
State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
2 shared publications
Latest Publications
- Open Access
- 29 August 2025
- Published by MDPI AG in Electronics
- Vol. 14 (17) , 3441
Efficient Private Information Retrieval Scheme with Dynamic Database
Private information retrieval (PIR) is a typical application scenario of encrypted computing, which allows users to retrieve data from a database by providing only an encrypted index. In an academic research scenario, multiple parties may entrust their data to a third party and require collaborative retrieval. However, due to competitive relationships and mutual distrust between these parties, they do not share public–private keys, making single-key mechanisms inadequate for meeting actual privacy requirements. In this case, based on the multi-key fully homomorphic encryption (MKFHE) algorithm, we construct an efficient PIR scheme with an access permission verification mechanism and dynamic database. Specifically, we design an MKFHE algorithm to protect multi-user privacy information. The vector–matrix multiplication optimization algorithm is adopted to improve computational efficiency, the expand algorithm is used to reduce user communication traffic, and homomorphic multiplication with ciphertext chunking is used to avoid excessive noise caused by direct ciphertext multiplication. Experiments based on the SEAL library show that by transferring part of the computational pressure to the offline stage, the online query response efficiency of our scheme is improved by about 7.69%, and the online computational efficiency of vector–matrix multiplication is improved by about 19.7%.
- 29 August 2025
- Published by MDPI AG in Electronics
- Vol. 14 (17) , 3441
Open AccessEfficient Private Information Retrieval Scheme with Dynamic Database
Private information retrieval (PIR) is a typical application scenario of encrypted computing, which allows users to retrieve data from a database by providing only an encrypted index. In an academic research scenario, multiple parties may entrust their data to a third party and require collaborative retrieval. However, due to competitive relationships and mutual distrust between these parties, they do not share public–private keys, making single-key mechanisms inadequate for meeting actual privacy requirements. In this case, based on the multi-key fully homomorphic encryption (MKFHE) algorithm, we construct an efficient PIR scheme with an access permission verification mechanism and dynamic database. Specifically, we design an MKFHE algorithm to protect multi-user privacy information. The vector–matrix multiplication optimization algorithm is adopted to improve computational efficiency, the expand algorithm is used to reduce user communication traffic, and homomorphic multiplication with ciphertext chunking is used to avoid excessive noise caused by direct ciphertext multiplication. Experiments based on the SEAL library show that by transferring part of the computational pressure to the offline stage, the online query response efficiency of our scheme is improved by about 7.69%, and the online computational efficiency of vector–matrix multiplication is improved by about 19.7%.
- 26 June 2024
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 17 (5) , 3182-3199
Verifiable privacy-preserving cox regression from multi-key fully homomorphic encryption
- 26 June 2024
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 17 (5) , 3182-3199
Verifiable privacy-preserving cox regression from multi-key fully homomorphic encryption
- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.- 3 January 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (1) , 303-317
Privacy-preserving association rule mining based on electronic medical system
Privacy protection during collaborative distributed association rule mining is an important research, which has been widely used in market prediction, medical research and other fields. In medical research, Domadiya et al. (Sadhana 43(8):127, 2018) focused on mining association rules from horizontally distributed healthcare data to diagnose heart disease. They claimed they proposed a more effective privacy-preserving distributed association rule mining (PPDARM) scheme. However, a serious security scrutiny of the scheme is performed, and we find it vulnerable to protect the support of the itemsets from any electronic health record (EHR) system, which is the most important parameter Domadiya et al. tried to protect. In this paper, we first present the cryptanalysis of the PPDARM scheme proposed by Domadiya et al. as well as some revised performance analyses. Then a new PPDARM scheme with less interactions is proposed to avert the shortcomings of Domadiya et al., using the homomorphic properties of the distributed Paillier cryptosystem to accomplish the cooperative computation. Our scheme allows the directed authority (miner) to obtain the final results rather than all cooperative EHR systems, in case of semi-honest but pseudo EHR systems. Moreover, security analysis and performance evaluation demonstrate our proposal is efficient and feasible.
- 3 January 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (1) , 303-317
Privacy-preserving association rule mining based on electronic medical system
Privacy protection during collaborative distributed association rule mining is an important research, which has been widely used in market prediction, medical research and other fields. In medical research, Domadiya et al. (Sadhana 43(8):127, 2018) focused on mining association rules from horizontally distributed healthcare data to diagnose heart disease. They claimed they proposed a more effective privacy-preserving distributed association rule mining (PPDARM) scheme. However, a serious security scrutiny of the scheme is performed, and we find it vulnerable to protect the support of the itemsets from any electronic health record (EHR) system, which is the most important parameter Domadiya et al. tried to protect. In this paper, we first present the cryptanalysis of the PPDARM scheme proposed by Domadiya et al. as well as some revised performance analyses. Then a new PPDARM scheme with less interactions is proposed to avert the shortcomings of Domadiya et al., using the homomorphic properties of the distributed Paillier cryptosystem to accomplish the cooperative computation. Our scheme allows the directed authority (miner) to obtain the final results rather than all cooperative EHR systems, in case of semi-honest but pseudo EHR systems. Moreover, security analysis and performance evaluation demonstrate our proposal is efficient and feasible.
- Open Access
- 28 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-14
Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials
Private information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size . In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving communication efficiency on the user side, irrelevant to the database size .
- 28 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-14
Open AccessEfficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials
Private information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size . In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving communication efficiency on the user side, irrelevant to the database size .
- Open Access
- 15 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 68373-68379
Attack and Improvement on a Symmetric Fully Homomorphic Encryption Scheme
Fully homomorphic encryption has been regarded as the holy grail of cryptography and supports meaningful computations on encrypted data. Recently, Kumer et al. proposed a symmetric fully homomorphic encryption scheme based on the Euler theorem. However, we illustrate in the paper that the secret key can be recovered from the homomorphic computation key and only a pair of known plaintext/ciphertext by computing the greatest common divisor with the Euclidean algorithm. Our observations are well supported by numerical experiments on the suggested parameters. Furthermore, an improvement on the scheme is presented. We mimic Dijk et al.’s idea to illustrate that the improvement can be reduced to AGCD problem. Several known attacks including the proposal in this paper are also examined.
- 15 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 68373-68379
Open AccessAttack and Improvement on a Symmetric Fully Homomorphic Encryption Scheme
Fully homomorphic encryption has been regarded as the holy grail of cryptography and supports meaningful computations on encrypted data. Recently, Kumer et al. proposed a symmetric fully homomorphic encryption scheme based on the Euler theorem. However, we illustrate in the paper that the secret key can be recovered from the homomorphic computation key and only a pair of known plaintext/ciphertext by computing the greatest common divisor with the Euclidean algorithm. Our observations are well supported by numerical experiments on the suggested parameters. Furthermore, an improvement on the scheme is presented. We mimic Dijk et al.’s idea to illustrate that the improvement can be reduced to AGCD problem. Several known attacks including the proposal in this paper are also examined.