Xiufeng Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiufeng Zhao has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Weitao Song
Information Engineering University, Zhengzhou, Henan, China
3 shared publications - Meng Wu
College of Cryptography Engineering, Information Engineering University, Zhengzhou 450001, China
2 shared publications Ailan Wang
Department of Information Research and Security, Zhengzhou Information Science Technology Institute, Zhengzhou, 450001, China
1 shared publication- Bo Zhang
University of Jinan
1 shared publication Hefeng Mao
Department of Information Research and Security
1 shared publication- Lei Guo
Physical Education Department of Shandong Technology and Business University, Yantai 264005, China
1 shared publication
Latest Publications
- Open Access
- 5 March 2025
- Published by MDPI AG in Information
- Vol. 16 (3) , 200
Bootstrapping Optimization Techniques for the FINAL Fully Homomorphic Encryption Scheme
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 and in the bootstrapping of the FINAL scheme, so that the standard deviations of keys and 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%.- 5 March 2025
- Published by MDPI AG in Information
- Vol. 16 (3) , 200
Open AccessBootstrapping Optimization Techniques for the FINAL Fully Homomorphic Encryption Scheme
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 and in the bootstrapping of the FINAL scheme, so that the standard deviations of keys and 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%. - Open Access
- 19 April 2024
- Published by Springer Nature in Research Square
Bootstrapping Optimization for Fully Homomorphic Encryption Schemes
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.
- 19 April 2024
- Published by Springer Nature in Research Square
Open AccessBootstrapping Optimization for Fully Homomorphic Encryption Schemes
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.
- 1 January 2023
- Published by Research Publishing Services
- p. 790-797
Improved Circular Secure Homomorphic Encryption Scheme
- 1 January 2023
- Published by Research Publishing Services
- p. 790-797
Improved Circular Secure Homomorphic Encryption Scheme
- RetractedOpen Access
- 2 March 2021
- Published by Hindawi Limited in Security and Communication Networks
- Vol. 2021, 1-9
Analysis of Characteristics of Tennis Singles Matches Based on 5G and Data Mining Technology
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.
- 2 March 2021
- Published by Hindawi Limited in Security and Communication Networks
- Vol. 2021, 1-9
RetractedOpen AccessAnalysis of Characteristics of Tennis Singles Matches Based on 5G and Data Mining Technology
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.
- Open Access
- 24 December 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-8
Generalized Bootstrapping Technique Based on Block Equality Test Algorithm
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.
- 24 December 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-8
Open AccessGeneralized Bootstrapping Technique Based on Block Equality Test Algorithm
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.
- Open Access
- 19 December 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-9
Analysis on Matrix GSW-FHE and Optimizing Bootstrapping
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 December 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-9
Open AccessAnalysis on Matrix GSW-FHE and Optimizing Bootstrapping
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.
- 31 March 2014
- Published by NADIA in International Journal of Security and Its Applications
- Vol. 8 (2) , 363-374
An Efficient Identity-based Signcryption from Lattice
- 31 March 2014
- Published by NADIA in International Journal of Security and Its Applications
- Vol. 8 (2) , 363-374
An Efficient Identity-based Signcryption from Lattice