Xiufeng Zhao

Prof. Dr. Xiufeng Zhao


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
2 March 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
MLMing Li
Ming Li
LQLi Qin-Sheng
Li Qin-Sheng
YLYuening Li
Yuening Li
YCYunkun Cui
Yunkun Cui
XZXiufeng Zhao
Xiufeng Zhao
LGLei Guo
Lei Guo
The level of technical and tactical decision-making in a tennis game has a very important impact on the outcome of the game. How to discover the characteristics and rules of the game from a large amount of technical and tactical data, how to overcome the shortcomings of traditional statistical methods, and how to provide a scientific basis for correct decision-making are a top priority. Based on 5G and association analysis data mining theory, we established a data mining model for tennis technical offensive tactics and association rules and conducted specific case studies. It can calculate the maximization and distribution rate of certain technologies, also distinguish between the athlete’s gain and loss rate and the spatial position on the track, and use artificial statistical methods to cause errors and subjective participation. This solution provides objective and scientific decision support for this problem and is used in the decision-making of the landing point in tennis match technology and tactics. Experimental simulation shows that the data mining technology analysis system used for regional tennis matches is more concise, efficient, and accurate than traditional movie analysis methods.

31 March 2014 in International Journal of Security and Its Applications
Verified
Journal Article
Closed access
XZXiufeng Zhao
Xiufeng Zhao
XWXiang Wang
Xiang Wang

24 December 2018 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
XZXiufeng Zhao
Xiufeng Zhao
AWAilan Wang
Ailan Wang
With the rapid development of cloud computation and big data, the data storage and outsource computation are delegated to the untrusted cloud, which has led to a series of challenging security and privacy threats. Fully homomorphic encryption can be used to protect the privacy of cloud data and solve the trust problem of third party. The key problem of achieving fully homomorphic encryption is how to reduce the increasing noise during the ciphertext evaluation. Bootstrapping procedure can refresh ciphertext with large error, such that the resulting ciphertext has potentially smaller error and allows being continuous homomorphic evaluation. In this paper, we investigated the bootstrapping procedure used to construct fully homomorphic encryption scheme. We proposed a new concept of block homomorphic equality test algorithm and gave an instance based on the FH-SIMD scheme. Furthermore, based on the block homomorphic equality test algorithm, we proposed a faster bootstrapping procedure with smaller bootstrapping keys. Both theory analysis and experiment simulation validate high performance of our bootstrapping algorithm.

5 March 2025 in Information
Verified
Journal Article
Open access
PDF file
MWMeng WU
Meng WU
XZXiufeng Zhao
Xiufeng Zhao
WSWeitao Song
Weitao Song
With the advent of cloud computing and the era of big data, there is an increasing focus on privacy computing. Consequently, homomorphic encryption, being a primary technique for achieving privacy computing, is held in high regard. Nevertheless, the efficiency of homomorphic encryption schemes is significantly impacted by bootstrapping. Enhancing the efficiency of bootstrapping necessitates a dual focus: reducing the computational burden of outer product operations integral to the process while rigorously constraining the noise generated by bootstrapping within predefined threshold limits. The FINAL scheme is a fully homomorphic encryption scheme based on the number theory research unit (NTRU) and learning with errors (LWE) assumptions. The performance of the FINAL scheme is better than that of the TFHE scheme, with faster bootstrapping and smaller bootstrapping and key-switching keys. In this paper, we introduce ellipsoidal Gaussian sampling to generate keys f and g in the bootstrapping of the FINAL scheme, so that the standard deviations of keys f and g are different and reduce the bootstrapping noise by 76%. However, when q is fixed, the boundary for bootstrapping noise remains constant. As a result, larger decomposition bases are used in bootstrapping to reduce the total number of polynomial multiplications by 47%, thus improving the efficiency of the FINAL scheme. The optimization scheme outperforms the original FINAL scheme with 33.3% faster bootstrapping, and the memory overhead of blind rotation keys is optimized by 47%.

19 December 2018 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
XZXiufeng Zhao
Xiufeng Zhao
HMHefeng Mao
Hefeng Mao
SLShuai Liu
Shuai Liu
WSWeitao Song
Weitao Song
BZBo Zhang
Bo Zhang
With the rapid development of multimedia technologies, the multimedia data storage and outsource computation are delegated to the untrusted cloud, which has led to a series of challenging security and privacy threats. Fully homomorphic encryption can be used to protect the privacy of cloud data and solve the trust problem of third party. In this paper, we analyse circular security of matrix GSW-FHE scheme. We derive a sufficient condition of circular security for matrix GSW-FHE scheme. It allows us to choose a good secret key via “reject sample” technique and furthermore obtain circular secure matrix GSW-FHE scheme. We also give an extended version of matrix GSW-FHE by defining deterministic asymmetric encryption algorithm and propose hybrid homomorphic plaintext slot-wise switching method, which significantly reduces computation and storage complexity of bootstrapping key generation, thus optimizing the bootstrapping procedure.

19 April 2024 in Research Square
Verified
Preprint
Open access
PDF file
MWMeng WU
Meng WU
XZXiufeng Zhao
Xiufeng Zhao
WSWeitao Song
Weitao Song
With the advent of cloud computing and the era of big data, there is an increasing focus on privacy computing. Consequently, homomorphic encryption, being a primary technique for achieving privacy computing, is held in high regard. Nevertheless, the efficiency of homomorphic encryption schemes is significantly impacted by boostrapping. FINAL scheme (ASIACRYPT 2022) is a fully homomorphic encryption scheme based on number theory research unit (NTRU) and learning with errors (LWE) assumptions proposed by Charlotte Bonte et al. The performance of the FINAL scheme is better than TFHE scheme, with a faster bootstrapping and smaller bootstrapping and key-switching keys. In this paper, we introduce ellipsoidal Gaussian sampling to generate the keys f and g in bootstrapping of FINAL scheme, so that the standard deviations of the keys f and g are different and reduce the bootstrapping noise. As a result, larger decomposition bases is used in bootstrapping to reduce the total number of polynomial multiplications, thus improving the efficiency of FINAL scheme. The optimization scheme outperforms the original FINAL scheme with a 33.3\% faster bootstrapping.