Kai He
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
Kai He has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Jian Weng
Guangzhou University
4 shared publications - Xueqiao Liu
University of Wollongong
4 shared publications - Jia-Nan Liu
Dongguan University of Technology
3 shared publications - Guomin Yang
Singapore Management University, Singapore, Singapore
2 shared publications Wei Liu
Jinan Univ, Coll Cyber Secur, Guangzhou 510632, Peoples R China
2 shared publications- Willy Susilo
Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, Australia
2 shared publications
Latest Publications
- 6 November 2026
- Published by Springer Nature
- p. 352-367
Convertible Multi-key Fully Homomorphic Encryption
- 6 November 2026
- Published by Springer Nature
- p. 352-367
Convertible Multi-key Fully Homomorphic Encryption
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. PP (5) , 1-16
PDTE: Outsourced Private Decision Tree Evaluation for Large Trees with Sublinear Communication
Decision trees are critical in domains like medical diagnosis and network security, but their evaluation often compromises privacy. Existing privacy-preserving methods either reduce accuracy or incur high overheads. To address these limitations, we propose an efficient outsourced Private Decision Tree Evaluation (PDTE) protocol under a two-cloud architecture, encoding the tree into a two-dimensional array and using Oblivious Selection (OS) for secure evaluation. Our PRF-based OS achieves sublinear communication, enabling large-scale tree evaluation. We also support private random forest evaluation and categorical feature handling. Experiments show up to 167× faster computation in LAN, more than 33× faster computation in MAN and 173× better communication efficiency. Our open-source implementation is available at https://github.com/LRYS6/PDTE.
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. PP (5) , 1-16
PDTE: Outsourced Private Decision Tree Evaluation for Large Trees with Sublinear Communication
Decision trees are critical in domains like medical diagnosis and network security, but their evaluation often compromises privacy. Existing privacy-preserving methods either reduce accuracy or incur high overheads. To address these limitations, we propose an efficient outsourced Private Decision Tree Evaluation (PDTE) protocol under a two-cloud architecture, encoding the tree into a two-dimensional array and using Oblivious Selection (OS) for secure evaluation. Our PRF-based OS achieves sublinear communication, enabling large-scale tree evaluation. We also support private random forest evaluation and categorical feature handling. Experiments show up to 167× faster computation in LAN, more than 33× faster computation in MAN and 173× better communication efficiency. Our open-source implementation is available at https://github.com/LRYS6/PDTE.
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 15 (2) , 2203-2213
Enabling Efficient and Malicious Secure Data Aggregation in Smart Grid With False Data Detection
As the next-generation power grid, the smart grid has significantly improved dependability, flexibility, and efficiency compared with the traditional power grid. However, due to increasingly diverse application requirements, it faces challenges on balancing data privacy, efficiency, and robustness. In this paper, we present a fog computing-based smart grid model. In addition, based on the proposed model, we construct an efficient and privacy-preserving scheme that supports malicious secure smart grid usage data aggregation communication. To our best knowledge, this is the first concrete smart grid solution that concurrently achieves secure aggregation communication, data privacy, and data robustness (e.g., false data detection). Specifically, benefiting from Boolean/Arithmetic secret-sharing methods, our proposed scheme allows home users to report their electricity usage data to the cloud and fogs securely. Besides, a false data detection protocol is proposed to resist false data injection attacks launched by malicious home users. Theoretical analysis and experimental implementation show that our scheme efficiently achieves data security, anonymity, and robustness.
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 15 (2) , 2203-2213
Enabling Efficient and Malicious Secure Data Aggregation in Smart Grid With False Data Detection
As the next-generation power grid, the smart grid has significantly improved dependability, flexibility, and efficiency compared with the traditional power grid. However, due to increasingly diverse application requirements, it faces challenges on balancing data privacy, efficiency, and robustness. In this paper, we present a fog computing-based smart grid model. In addition, based on the proposed model, we construct an efficient and privacy-preserving scheme that supports malicious secure smart grid usage data aggregation communication. To our best knowledge, this is the first concrete smart grid solution that concurrently achieves secure aggregation communication, data privacy, and data robustness (e.g., false data detection). Specifically, benefiting from Boolean/Arithmetic secret-sharing methods, our proposed scheme allows home users to report their electricity usage data to the cloud and fogs securely. Besides, a false data detection protocol is proposed to resist false data injection attacks launched by malicious home users. Theoretical analysis and experimental implementation show that our scheme efficiently achieves data security, anonymity, and robustness.
- 3 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 4929-4943
Privacy-Preserving Multi-User Outsourced Computation for Boolean Circuits
With the prevalence of outsourced computation, such as Machine Learning as a Service, protecting the privacy of sensitive data throughout the whole computation is a critical yet challenging task. The problem becomes even more tricky when multiple sources of input and/or multiple recipients of output are involved, who would encrypt/decrypt data using different keys. Considering many computation tasks demand binary operands and operations but there are only outsourced computation constructions for arithmetic calculations [1], in this paper, the authors propose a privacy-preserving outsourced computation framework for Boolean circuits. The proposed framework can protect sensitive data throughout the whole computation, i.e., input, output and all the intermediate values, ensuring privacy for general outsourced tasks. Moreover, it compresses the ciphertext domain of [1] and attains secure protocols for four logic gates (AND, OR, NOT, and XOR) which are the basic operations in Boolean circuits. With the proposed framework as a building block, a novel Privacy-preserved (encrypted) Bloom Filter and a Multi-keyword Searchable Encryption scheme under the multi-user setting are presented. Security proof and experimental results show that the proposal is reliable and practical.
- 3 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 4929-4943
Privacy-Preserving Multi-User Outsourced Computation for Boolean Circuits
With the prevalence of outsourced computation, such as Machine Learning as a Service, protecting the privacy of sensitive data throughout the whole computation is a critical yet challenging task. The problem becomes even more tricky when multiple sources of input and/or multiple recipients of output are involved, who would encrypt/decrypt data using different keys. Considering many computation tasks demand binary operands and operations but there are only outsourced computation constructions for arithmetic calculations [1], in this paper, the authors propose a privacy-preserving outsourced computation framework for Boolean circuits. The proposed framework can protect sensitive data throughout the whole computation, i.e., input, output and all the intermediate values, ensuring privacy for general outsourced tasks. Moreover, it compresses the ciphertext domain of [1] and attains secure protocols for four logic gates (AND, OR, NOT, and XOR) which are the basic operations in Boolean circuits. With the proposed framework as a building block, a novel Privacy-preserved (encrypted) Bloom Filter and a Multi-keyword Searchable Encryption scheme under the multi-user setting are presented. Security proof and experimental results show that the proposal is reliable and practical.
- 12 September 2022
- Published by Elsevier in Information Sciences
- Vol. 613, 324-343
Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity Languages
- 12 September 2022
- Published by Elsevier in Information Sciences
- Vol. 613, 324-343
Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity Languages
- Open Access
- 13 December 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-11
Efficient Identity-Based Broadcast Encryption Scheme on Lattices for the Internet of Things
In an identity-based broadcast encryption (IBBE) scheme, the ciphertext is usually appended with a set of user identities to specify intended recipients. However, as IBBE is adopted in extensive industries, the demand of anonymity for specific scenarios such as military applications is urgent and ought no more to be ignored. On the contrary, how to optimize computation and communication is an unavoidable challenge in the IBBE scheme construction, especially in the large-scaled resource-limited wireless networks such as the Internet of Things (IoT), where the cost of computation and communication should be mitigated as much as possible since other functions including connectivity and privacy should be given the top priority. Thus, we present an IBBE scheme from the lattice, in which we employ the Chinese remainder theorem and lattice basis delegation in fixed dimensions to obtain several desirable characteristics, such as constant-size public parameter, private key, and ciphertext. In addition, our encryption and decryption algorithms are more efficient than broadcast encryption (BE) schemes based on number-theoretic problems. To be noticed, our scheme can simultaneously achieve confidentiality and outsider anonymity against the chosen-plaintext attack under the hardness of the learning with error (LWE) problem.
- 13 December 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-11
Open AccessEfficient Identity-Based Broadcast Encryption Scheme on Lattices for the Internet of Things
In an identity-based broadcast encryption (IBBE) scheme, the ciphertext is usually appended with a set of user identities to specify intended recipients. However, as IBBE is adopted in extensive industries, the demand of anonymity for specific scenarios such as military applications is urgent and ought no more to be ignored. On the contrary, how to optimize computation and communication is an unavoidable challenge in the IBBE scheme construction, especially in the large-scaled resource-limited wireless networks such as the Internet of Things (IoT), where the cost of computation and communication should be mitigated as much as possible since other functions including connectivity and privacy should be given the top priority. Thus, we present an IBBE scheme from the lattice, in which we employ the Chinese remainder theorem and lattice basis delegation in fixed dimensions to obtain several desirable characteristics, such as constant-size public parameter, private key, and ciphertext. In addition, our encryption and decryption algorithms are more efficient than broadcast encryption (BE) schemes based on number-theoretic problems. To be noticed, our scheme can simultaneously achieve confidentiality and outsider anonymity against the chosen-plaintext attack under the hardness of the learning with error (LWE) problem.
- 4 November 2021
- Published by Springer Nature
- p. 193-213
Broadcast Authenticated Encryption with Keyword Search
- 4 November 2021
- Published by Springer Nature
- p. 193-213
Broadcast Authenticated Encryption with Keyword Search
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 747-752
ACS-WAM: An Access Control Scheme Supporting Write Authority Management in Cloud-assisted Cyber-Physical Systems
In Cloud-assisted Cyber-Physical Systems, data is produced on monitoring devices, collected and aggregated on controllers, and uploaded on cloud storage system. There is undoubtedly a need for encryption in each stage of data processing. The judgement of ciphertext aggregating permission, which is usually done on controllers, becomes difficult due to the heterogeneity of monitoring devices. Besides, controllers can also transfer the data aggregating to cloud because of their limited resources. Due to data aggregating, data write control must be considered. However, ABE (Attribute Based Encryption), as a fine-grained scalable access control method, is used to realize the judgement of data read permission, but not the one of data write permission. In this scene, a controller needs cloud to aid him/her to judge whether or not a device's request writing data is accepted, and the less cloud knows, the better. In this work, we propose an Access Control Scheme supporting Write Authority Management (ACS-WAM): 1) It supports write privilege control on the same data written by multiple devices. In other words, it prevents an attacker from participating in the data aggregation as a device by injecting false data. 2) It provides reusability of the semi-hidden write access control policy in the cloud-assisted write authority management, thus cloud can aid an controller to realize write privilege control with the leakage of policy as little as possible.
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 747-752
ACS-WAM: An Access Control Scheme Supporting Write Authority Management in Cloud-assisted Cyber-Physical Systems
In Cloud-assisted Cyber-Physical Systems, data is produced on monitoring devices, collected and aggregated on controllers, and uploaded on cloud storage system. There is undoubtedly a need for encryption in each stage of data processing. The judgement of ciphertext aggregating permission, which is usually done on controllers, becomes difficult due to the heterogeneity of monitoring devices. Besides, controllers can also transfer the data aggregating to cloud because of their limited resources. Due to data aggregating, data write control must be considered. However, ABE (Attribute Based Encryption), as a fine-grained scalable access control method, is used to realize the judgement of data read permission, but not the one of data write permission. In this scene, a controller needs cloud to aid him/her to judge whether or not a device's request writing data is accepted, and the less cloud knows, the better. In this work, we propose an Access Control Scheme supporting Write Authority Management (ACS-WAM): 1) It supports write privilege control on the same data written by multiple devices. In other words, it prevents an attacker from participating in the data aggregation as a device by injecting false data. 2) It provides reusability of the semi-hidden write access control policy in the cloud-assisted write authority management, thus cloud can aid an controller to realize write privilege control with the leakage of policy as little as possible.
- Open Access
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 50658-50668
A New Encrypted Data Switching Protocol: Bridging IBE and ABE Without Loss of Data Confidentiality
Encryption technologies have become one of the most prevalent solutions to safeguard data confidentiality in many real-world applications, e.g., cloud-based data storage systems. Encryption outputting a relatively “static” format of encrypted data, however, may hinder further data operations. For example, encrypted data may need to be “transformed” into other formats for computation or other purposes. To enable encryption to be used in another device equipped with a different encryption mechanism, the concept of encryption switching was first proposed in CRYPTO 2016 for conversion particularly between Paillier and ElGamal encryptions. This paper considers the conversion between conventional identity-based and attribute-based encryptions and further proposes a concrete construction via the technique of proxy re-encryption. The construction is proved to be CPA secure in the standard model under q-decisional parallel bilinear Diffie-Hellman exponent assumption. The performance comparisons highlight that our bridging mechanism reduces computation and communication cost on the client side, especially when the data of the client is encrypted and outsourced to a remote cloud. The computational costs with respect to re-encryption (on the server side) and decryption (on the client side) are acceptable in practice.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 50658-50668
Open AccessA New Encrypted Data Switching Protocol: Bridging IBE and ABE Without Loss of Data Confidentiality
Encryption technologies have become one of the most prevalent solutions to safeguard data confidentiality in many real-world applications, e.g., cloud-based data storage systems. Encryption outputting a relatively “static” format of encrypted data, however, may hinder further data operations. For example, encrypted data may need to be “transformed” into other formats for computation or other purposes. To enable encryption to be used in another device equipped with a different encryption mechanism, the concept of encryption switching was first proposed in CRYPTO 2016 for conversion particularly between Paillier and ElGamal encryptions. This paper considers the conversion between conventional identity-based and attribute-based encryptions and further proposes a concrete construction via the technique of proxy re-encryption. The construction is proved to be CPA secure in the standard model under q-decisional parallel bilinear Diffie-Hellman exponent assumption. The performance comparisons highlight that our bridging mechanism reduces computation and communication cost on the client side, especially when the data of the client is encrypted and outsourced to a remote cloud. The computational costs with respect to re-encryption (on the server side) and decryption (on the client side) are acceptable in practice.
- 7 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 17 (6) , 1207-1217
Attribute-Based Hybrid Boolean Keyword Search over Outsourced Encrypted Data
With cloud computing becoming increasingly popular, there has been a rapid increase in the number of data owners who outsource their data to the cloud while allowing users to retrieve the data. To preserve the privacy of data, data owners usually encrypt their data before outsourcing them to the cloud, and cloud servers can search across the ciphertext domain on behalf of users without learning any information about the data. However, existing work in the literature mostly supports only a single-user or single-keyword search which is not able to satisfy more desired expressive search. Thus, we propose a searchable encryption primitive with attribute-based access control for hybrid boolean keyword search over outsourced encrypted data. There exist several desirable features: (1) Data owners can set search permissions for outsourced encrypted data according to an access control policy. (2) Multiple users, whose attributes satisfy the access control policy, are allowed to perform a retrieval operation upon the encrypted data. (3) Authorized users are able to perform more expressive search, such as any required boolean keyword expression search. Additionally, this primitive is provably secure under our security model and we have also implemented the prototype to show the practicality of the primitive.
- 7 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 17 (6) , 1207-1217
Attribute-Based Hybrid Boolean Keyword Search over Outsourced Encrypted Data
With cloud computing becoming increasingly popular, there has been a rapid increase in the number of data owners who outsource their data to the cloud while allowing users to retrieve the data. To preserve the privacy of data, data owners usually encrypt their data before outsourcing them to the cloud, and cloud servers can search across the ciphertext domain on behalf of users without learning any information about the data. However, existing work in the literature mostly supports only a single-user or single-keyword search which is not able to satisfy more desired expressive search. Thus, we propose a searchable encryption primitive with attribute-based access control for hybrid boolean keyword search over outsourced encrypted data. There exist several desirable features: (1) Data owners can set search permissions for outsourced encrypted data according to an access control policy. (2) Multiple users, whose attributes satisfy the access control policy, are allowed to perform a retrieval operation upon the encrypted data. (3) Authorized users are able to perform more expressive search, such as any required boolean keyword expression search. Additionally, this primitive is provably secure under our security model and we have also implemented the prototype to show the practicality of the primitive.