Zhenhua Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zhenhua Chen has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Willy Susilo
Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, Australia
3 shared publications - Hao Wang
Shandong Normal University
2 shared publications Jingjing Nie
Department of Computer Science and Technology, Xi’an University of Science and Technology , Xi’an, 710054 , China
2 shared publications- Luqi Huang
School of Computing and Information Technology, Institute of Cybersecurity and Cryptology, University of Wollongong, Wollongong, NSW, Australia
2 shared publications Ni Li
Department of Computer Science and Technology, Xi’an University of Science and Technology , Xi’an, 710054 , China
2 shared publications- Ni Li
College of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an, China
2 shared publications
Latest Publications
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 316-328
An Unbounded Multi-Input Quadratic Functional Encryption Scheme for Secure Cloud-Based Machine Learning
With the advent of cloud computing, traditional machine learning (ML) are migrating into cloud-based ML day by day following the concept of machine learning as a cloud service, which enables multiple entities to contribute to and benefit from shared datasets and models. As well as training the linear classification model, training the nonlinear classification model is also an essential task in cloud-based ML. However, this task commonly involves learning knowledge from different datasets provided by various entities, which often contain sensitive information like patients' physiological indices. Therefore, it gives rise a natural question how to allow multiple users collaboratively participating in a nonlinear classification task while preserving these datas' privacy. As a promising cryptographic tool, the concept of unbounded multiinput functional encryption can be developed to answer such a question, such as google search engines are running over this concept-based ML approaches. However, most of existing approaches are derived from this concept with inner product functionality, specifying for a linear classification model and thus fails to cope with a non-linear classification one. In this paper, we introduce an advanced cryptographic concept called unbounded multi-input quadratic functional encryption, and give a concrete construction which allows arbitrary number of users participating in the classifying tasks with a nonlinear classification model but without divulging their private data. Moreover, we provide a strict mathematical security proof under a well-defined security model as well as some security attacks are analyzed, followed by an experimental analysis and comparison on a real dateset as well as a practical use case to demonstrate our scheme's performance.
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 316-328
An Unbounded Multi-Input Quadratic Functional Encryption Scheme for Secure Cloud-Based Machine Learning
With the advent of cloud computing, traditional machine learning (ML) are migrating into cloud-based ML day by day following the concept of machine learning as a cloud service, which enables multiple entities to contribute to and benefit from shared datasets and models. As well as training the linear classification model, training the nonlinear classification model is also an essential task in cloud-based ML. However, this task commonly involves learning knowledge from different datasets provided by various entities, which often contain sensitive information like patients' physiological indices. Therefore, it gives rise a natural question how to allow multiple users collaboratively participating in a nonlinear classification task while preserving these datas' privacy. As a promising cryptographic tool, the concept of unbounded multiinput functional encryption can be developed to answer such a question, such as google search engines are running over this concept-based ML approaches. However, most of existing approaches are derived from this concept with inner product functionality, specifying for a linear classification model and thus fails to cope with a non-linear classification one. In this paper, we introduce an advanced cryptographic concept called unbounded multi-input quadratic functional encryption, and give a concrete construction which allows arbitrary number of users participating in the classifying tasks with a nonlinear classification model but without divulging their private data. Moreover, we provide a strict mathematical security proof under a well-defined security model as well as some security attacks are analyzed, followed by an experimental analysis and comparison on a real dateset as well as a practical use case to demonstrate our scheme's performance.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 817-829
Cer-FeaUn: Certified Feature Unlearning in Vertical Federated Learning
Feature unlearning, forgetting sensitive features while maintaining the accuracy of models, is a pressing issue against Feature Inference Attacks (FIA) in Vertical Federated Learning (VFL). This issue is addressed by retraining the model from scratch on a dataset without the sensitive features from scratch or Federated Unlearning (FU) for all samples. However, they either introduce high overheads due to retraining or reduce the accuracy of the unlearned model. In this paper, we proposed Cer-FeaUn, a certified feature unlearning, trading off between the overheads and accuracy. Specifically, a novel feature perturbation strategy is first proposed to construct a perturbed dataset, where the sensitive features are perturbed with noises. Then, the effect is defined as the parameters difference between models trained with the original and perturbed dataset. Finally, an unlearned model is trained in first-order, where the effect is removed from the original model in one epoch. Furthermore, Cer-FeaUn performs certified removal for server-side models with strongly convex loss functions. That is, the distribution of the unlearned model is statistically indistinguishable from that of the retrained model. For the scenario with a few sensitive features, simulation results show that the accuracy of the unlearned model is up to 84.79%, and the runtime of Cer-FeaUn is 15 times faster than that of the retrained model.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 817-829
Cer-FeaUn: Certified Feature Unlearning in Vertical Federated Learning
Feature unlearning, forgetting sensitive features while maintaining the accuracy of models, is a pressing issue against Feature Inference Attacks (FIA) in Vertical Federated Learning (VFL). This issue is addressed by retraining the model from scratch on a dataset without the sensitive features from scratch or Federated Unlearning (FU) for all samples. However, they either introduce high overheads due to retraining or reduce the accuracy of the unlearned model. In this paper, we proposed Cer-FeaUn, a certified feature unlearning, trading off between the overheads and accuracy. Specifically, a novel feature perturbation strategy is first proposed to construct a perturbed dataset, where the sensitive features are perturbed with noises. Then, the effect is defined as the parameters difference between models trained with the original and perturbed dataset. Finally, an unlearned model is trained in first-order, where the effect is removed from the original model in one epoch. Furthermore, Cer-FeaUn performs certified removal for server-side models with strongly convex loss functions. That is, the distribution of the unlearned model is statistically indistinguishable from that of the retrained model. For the scenario with a few sensitive features, simulation results show that the accuracy of the unlearned model is up to 84.79%, and the runtime of Cer-FeaUn is 15 times faster than that of the retrained model.
- 11 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25867-25878
An Asymmetric Searchable Encryption Scheme Supporting Shortest Distance Query in Internet of Vehicles
With the advent of Internet technologies, the concept of conventional vehicular ad hoc network is gradually migrating into the Internet of Vehicles (IoV). Meanwhile, as a common data structure composed of vertices and edges, graph commonly used to represent road network typologies, are also outsourced to Internet servers for the convenience of people in IoV accessing the road network anytime and anywhere. However, it introduces much potential risks on people’s privacy as the Internet servers are often assumed semi-honest. As an essential component in IoV, privacy-preserving shortest distance query has been researched many years in the cryptographic community. Unfortunately, most of the solutions are designed under symmetric key setting and employ some off-the-shelf cryptographic primitives. They are impractical in the multiuser IoV environment due to an inherent weakness—key agreement required between each pair of a graph data provider and a user since the symmetric key encryption was born. Moreover, these off-the-shelf primitives ask multiple Internet servers or graph data providers to interact in the test process in order to assist one Internet server returning the shortest distance to users, both of which thereby raise a significant communication cost. To overcome these drawbacks, in this article, we propose an asymmetric searchable encryption scheme supporting shortest distance query, which is quite suitable for multiuser IoV environment since the key agreement is no longer required between each pair of a graph data provider and a user. In particular, we present a new cryptographic primitive instead of leveraging any ready-made one, that enables only one server in IoV to be required for returning the final query result—shortest distance to users without any interaction with others, thereby reducing the communication cost. Finally, a strict mathematical security proof is offered as well as some security attacks are analyzed, followed by an experimental evaluation and comparison.
- 11 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25867-25878
An Asymmetric Searchable Encryption Scheme Supporting Shortest Distance Query in Internet of Vehicles
With the advent of Internet technologies, the concept of conventional vehicular ad hoc network is gradually migrating into the Internet of Vehicles (IoV). Meanwhile, as a common data structure composed of vertices and edges, graph commonly used to represent road network typologies, are also outsourced to Internet servers for the convenience of people in IoV accessing the road network anytime and anywhere. However, it introduces much potential risks on people’s privacy as the Internet servers are often assumed semi-honest. As an essential component in IoV, privacy-preserving shortest distance query has been researched many years in the cryptographic community. Unfortunately, most of the solutions are designed under symmetric key setting and employ some off-the-shelf cryptographic primitives. They are impractical in the multiuser IoV environment due to an inherent weakness—key agreement required between each pair of a graph data provider and a user since the symmetric key encryption was born. Moreover, these off-the-shelf primitives ask multiple Internet servers or graph data providers to interact in the test process in order to assist one Internet server returning the shortest distance to users, both of which thereby raise a significant communication cost. To overcome these drawbacks, in this article, we propose an asymmetric searchable encryption scheme supporting shortest distance query, which is quite suitable for multiuser IoV environment since the key agreement is no longer required between each pair of a graph data provider and a user. In particular, we present a new cryptographic primitive instead of leveraging any ready-made one, that enables only one server in IoV to be required for returning the final query result—shortest distance to users without any interaction with others, thereby reducing the communication cost. Finally, a strict mathematical security proof is offered as well as some security attacks are analyzed, followed by an experimental evaluation and comparison.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 2621-2631
A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms
As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 2621-2631
A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms
As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.
- 22 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (2) , 2998-3013
Joint One-Hop Flooding Communication and Event-Triggered Distributed Trajectory Fusion in Spatiotemporal Constraint Sensor Networks
In this work, we investigate the challenging problem of multitarget relay tracking with random appearance and disappearance in spatiotemporal sensor networks. In this scenario, sensor networks can be coordinated in a decentralized manner. In response, we propose a novel distributed trajectory fusion (DTF) method. Each local sensor, operating without prior knowledge of the network topology, performs different tasks based on target-oriented local trajectory estimation in three modes: source transmission mode (STM), passive receiving mode (PRM), and intermediate relay mode (IRM). Specifically, STM focuses on computing one-hop direct neighbors, PRM deals with the trajectory fusion, and IRM involves efficient communication through joint one-hop flooding and an event-triggered scheme, ensuring robust trajectory fusion. Our method incorporates Gaussian mixture approximated trajectory Poisson multi-Bernoulli filter with spatiotemporal constraints (GM-TPMB-STC) to accurately capture expected target movements as they enter the area of interest. Simulation results demonstrate the superiority of our proposed method over existing distributed target state and density fusion methods in both accuracy and computational efficiency, offering a promising solution to multitarget tracking in complex environments.
- 22 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (2) , 2998-3013
Joint One-Hop Flooding Communication and Event-Triggered Distributed Trajectory Fusion in Spatiotemporal Constraint Sensor Networks
In this work, we investigate the challenging problem of multitarget relay tracking with random appearance and disappearance in spatiotemporal sensor networks. In this scenario, sensor networks can be coordinated in a decentralized manner. In response, we propose a novel distributed trajectory fusion (DTF) method. Each local sensor, operating without prior knowledge of the network topology, performs different tasks based on target-oriented local trajectory estimation in three modes: source transmission mode (STM), passive receiving mode (PRM), and intermediate relay mode (IRM). Specifically, STM focuses on computing one-hop direct neighbors, PRM deals with the trajectory fusion, and IRM involves efficient communication through joint one-hop flooding and an event-triggered scheme, ensuring robust trajectory fusion. Our method incorporates Gaussian mixture approximated trajectory Poisson multi-Bernoulli filter with spatiotemporal constraints (GM-TPMB-STC) to accurately capture expected target movements as they enter the area of interest. Simulation results demonstrate the superiority of our proposed method over existing distributed target state and density fusion methods in both accuracy and computational efficiency, offering a promising solution to multitarget tracking in complex environments.
- Open Access
- 15 November 2024
- Published by EWA Publishing in Applied and Computational Engineering
- Vol. 100 (1) , 110-120
Secure Search of Smart Home Data Based on Access Control Encryption
In recent years, the increasing variety of smart home devices, such as smart locks, surveillance cameras, and various sensors, has led to a significant rise in related data. To facilitate the sharing of smart home data, manufacturers store these data on the Internet of Things (IoT). However, since IoT servers are not fully trustworthy and the data often contain sensitive commercial information, any leakage could result in a commercial crisis for manufacturers. To address security concerns, manufacturers encrypt the data before storing them on the IoT. A challenge arises: how can users search for target data in encrypted form? This paper proposes a new search encryption scheme for smart home data, addressing the limitations of existing attribute-based encryption (ABE) searchable encryption schemes. The proposed scheme integrates access control trees and bilinear mapping technology, supporting multiple access policies including “AND” gates, “OR” gates, and “threshold” gates. Experimental results demonstrate a comprehensive analysis of the attribute-based searchable encryption protocol under a multi-authority architecture, covering four dimensions: correctness, security, complexity, and real-world application scenarios. In specific scenarios, when a data user, out of privacy concerns, is unwilling to reveal all attribute information to a single authority during a query for shared data—thus avoiding identity disclosure—or when the user’s identity information is managed by multiple independent authorities, this protocol proves highly effective. It ensures smooth data sharing while maintaining data security for both data owners and users, fully safeguarding data privacy and shareability.
- 15 November 2024
- Published by EWA Publishing in Applied and Computational Engineering
- Vol. 100 (1) , 110-120
Open AccessSecure Search of Smart Home Data Based on Access Control Encryption
In recent years, the increasing variety of smart home devices, such as smart locks, surveillance cameras, and various sensors, has led to a significant rise in related data. To facilitate the sharing of smart home data, manufacturers store these data on the Internet of Things (IoT). However, since IoT servers are not fully trustworthy and the data often contain sensitive commercial information, any leakage could result in a commercial crisis for manufacturers. To address security concerns, manufacturers encrypt the data before storing them on the IoT. A challenge arises: how can users search for target data in encrypted form? This paper proposes a new search encryption scheme for smart home data, addressing the limitations of existing attribute-based encryption (ABE) searchable encryption schemes. The proposed scheme integrates access control trees and bilinear mapping technology, supporting multiple access policies including “AND” gates, “OR” gates, and “threshold” gates. Experimental results demonstrate a comprehensive analysis of the attribute-based searchable encryption protocol under a multi-authority architecture, covering four dimensions: correctness, security, complexity, and real-world application scenarios. In specific scenarios, when a data user, out of privacy concerns, is unwilling to reveal all attribute information to a single authority during a query for shared data—thus avoiding identity disclosure—or when the user’s identity information is managed by multiple independent authorities, this protocol proves highly effective. It ensures smooth data sharing while maintaining data security for both data owners and users, fully safeguarding data privacy and shareability.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (5) , 5148-5159
Two Practical Attribute-Based Encryption Schemes for Privacy-Preserving Mobile Location-Sharing Applications
Location sharing, as an essential component of mobile applications, helps mobile users share location information and enhance their community connections. However, users may be reluctant to share their locations with personal privacy concerns, as anyone including location server who knows these locations can infer much sensitive information about users through analyzing these locations’ information plus their background knowledge. Therefore, it poses a natural question for mobile location-sharing applications how to share users’ locations without any breach of their privacy. To answer this question, in this paper we describe two practical attribute based encryption schemes served privacy-preserving mobile location-sharing applications. Our proposals are quite suitable for such a mobile application – location sharing with common interests since in our designs users’ interests are also taken into consideration as well as location information. In particular, our two schemes have a higher performance in the sense that in our first construction both ciphertexts and private keys are of constant size simultaneously, and our second construction is an extension of the first that provides a tradeoff between ciphertext size and public key size. Therefore, the two schemes we designed in this work are quite practical in mobile applications which are often equipped with limited transmission or storage resources. Finally, we offer a formal security proof under a well-defined security model, followed by an experimental evaluation and a theoretical performance comparison.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (5) , 5148-5159
Two Practical Attribute-Based Encryption Schemes for Privacy-Preserving Mobile Location-Sharing Applications
Location sharing, as an essential component of mobile applications, helps mobile users share location information and enhance their community connections. However, users may be reluctant to share their locations with personal privacy concerns, as anyone including location server who knows these locations can infer much sensitive information about users through analyzing these locations’ information plus their background knowledge. Therefore, it poses a natural question for mobile location-sharing applications how to share users’ locations without any breach of their privacy. To answer this question, in this paper we describe two practical attribute based encryption schemes served privacy-preserving mobile location-sharing applications. Our proposals are quite suitable for such a mobile application – location sharing with common interests since in our designs users’ interests are also taken into consideration as well as location information. In particular, our two schemes have a higher performance in the sense that in our first construction both ciphertexts and private keys are of constant size simultaneously, and our second construction is an extension of the first that provides a tradeoff between ciphertext size and public key size. Therefore, the two schemes we designed in this work are quite practical in mobile applications which are often equipped with limited transmission or storage resources. Finally, we offer a formal security proof under a well-defined security model, followed by an experimental evaluation and a theoretical performance comparison.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (3) , 789-803
Attribute-Hiding Fuzzy Encryption for Privacy-Preserving Data Evaluation
Privacy-preserving data evaluation is one of the prominent research topics in the big data era. In many data evaluation applications that involve sensitive information, such as the medical records of patients in a medical system, protecting data privacy during the data evaluation process has become an essential requirement. Aiming at solving this problem, numerous fuzzy encryption systems for different similarity metrics have been proposed in literature. Unfortunately, the existing fuzzy encryption systems either fail to achieve attribute-hiding or achieve it, but are impractical. In this paper, we propose a new fuzzy encryption scheme for privacy-preserving data evaluation based on overlap distance, which can work in an integer domain while achieving attribute-hiding. In particular, we develop a novel approach to enable an accurate overlap distance to be fast calculated. This technique makes the number of pairing operations during decryption stage negative correlation with the size of the threshold, which is pretty practical for some applications especially with a large threshold. Additionally, we provide a formal security analysis of the proposed scheme, followed by a comprehensive experimental. Also we show that our scheme can be well applied to some scenarios, such as fuzzy keyword searchable encryption and attribute-hiding closest substring encryption.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (3) , 789-803
Attribute-Hiding Fuzzy Encryption for Privacy-Preserving Data Evaluation
Privacy-preserving data evaluation is one of the prominent research topics in the big data era. In many data evaluation applications that involve sensitive information, such as the medical records of patients in a medical system, protecting data privacy during the data evaluation process has become an essential requirement. Aiming at solving this problem, numerous fuzzy encryption systems for different similarity metrics have been proposed in literature. Unfortunately, the existing fuzzy encryption systems either fail to achieve attribute-hiding or achieve it, but are impractical. In this paper, we propose a new fuzzy encryption scheme for privacy-preserving data evaluation based on overlap distance, which can work in an integer domain while achieving attribute-hiding. In particular, we develop a novel approach to enable an accurate overlap distance to be fast calculated. This technique makes the number of pairing operations during decryption stage negative correlation with the size of the threshold, which is pretty practical for some applications especially with a large threshold. Additionally, we provide a formal security analysis of the proposed scheme, followed by a comprehensive experimental. Also we show that our scheme can be well applied to some scenarios, such as fuzzy keyword searchable encryption and attribute-hiding closest substring encryption.
- 18 December 2023
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (5) , 1941-1950
Kth min Threshold Encryption for Privacy-preserving Data Evaluation
The $k$th min threshold is to judge whether the $k$th smallest element of an attribute set along with a confidential file is greater than a predefined threshold, which is a fundamental, primitive operation in data evaluation, such as risk evaluation in business investment. However, it will compromise the privacy of the confidential files when proceeding with such a data evaluation because there is often a large amount of sensitive information involved in them, which the organizations/individuals are reluctant to expose due to the risk of losing a competitive advantage. Motivated by the issue how to preserve the privacy of the confidential files during data evaluation, in this research, we first present a new encryption notion called $k$th min threshold encryption (KTE) for serving privacy-preserving data evaluation. In this notion, the confidential file will be encrypted under an attribute set for its privacy protection prior to being sent to a receiver, and a decryption key is generated from a threshold $d$ and a rank $k$ of element, both selected by the receiver. The decryption will be successful if and only if the $k$th smallest element of the attribute set is greater than $d$. We then describe a concrete construction of KTE in the public-key setting. In particular, our construction features optimally short private keys, which only consists of one group element. By virtue of this advantage, it is quite practical because of only two pairing operations for decryption computation.- 18 December 2023
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (5) , 1941-1950
Kth min Threshold Encryption for Privacy-preserving Data Evaluation
The $k$th min threshold is to judge whether the $k$th smallest element of an attribute set along with a confidential file is greater than a predefined threshold, which is a fundamental, primitive operation in data evaluation, such as risk evaluation in business investment. However, it will compromise the privacy of the confidential files when proceeding with such a data evaluation because there is often a large amount of sensitive information involved in them, which the organizations/individuals are reluctant to expose due to the risk of losing a competitive advantage. Motivated by the issue how to preserve the privacy of the confidential files during data evaluation, in this research, we first present a new encryption notion called $k$th min threshold encryption (KTE) for serving privacy-preserving data evaluation. In this notion, the confidential file will be encrypted under an attribute set for its privacy protection prior to being sent to a receiver, and a decryption key is generated from a threshold $d$ and a rank $k$ of element, both selected by the receiver. The decryption will be successful if and only if the $k$th smallest element of the attribute set is greater than $d$. We then describe a concrete construction of KTE in the public-key setting. In particular, our construction features optimally short private keys, which only consists of one group element. By virtue of this advantage, it is quite practical because of only two pairing operations for decryption computation.- 27 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2672-2684
Geometric Searchable Encryption for Privacy-Preserving Location-Based Services
Location data play an important role in location-based services (LBS) since they can help a service provider analyze users' daily activities and further derive users' behavioral patterns. However, in the meanwhile the use of the location data in LBS can also enable the service provider to track users' journeys which will reveal their personal information, such as house address and places of interest they visited, all of which users are usually unwilling to disclose. Therefore, security and privacy incidents can and do occur often. In this paper, aiming at how to hide location privacy and meanwhile provide an accurate search for LBS, we design a new geometric searchable encryption scheme under a public-key system (a.k.a. asymmetric system) for different types of geometric range queries, which enables the service provider to respond to the range queries from users accurately without learning the information about users' location. Towards this goal, we first exploit a novel encoding, and then develop some sophisticated transformations in combination with a special pairing function, which eventually converts different types of geometric range queries in LBS into different inner product problems. Finally, we present our construction by virtue of the techniques above with the inner product encryption technique. In addition, a comprehensive experimental analysis running on a specific application of privacy-preserving LBS and comparison demonstrate, our proposal is able to guarantee a higher accuracy for users' range queries without any false positive, and meanwhile express richer queries. Furthermore, we show another application of our proposal to privacy-preserving remote medical diagnosis at the end of this paper.
- 27 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2672-2684
Geometric Searchable Encryption for Privacy-Preserving Location-Based Services
Location data play an important role in location-based services (LBS) since they can help a service provider analyze users' daily activities and further derive users' behavioral patterns. However, in the meanwhile the use of the location data in LBS can also enable the service provider to track users' journeys which will reveal their personal information, such as house address and places of interest they visited, all of which users are usually unwilling to disclose. Therefore, security and privacy incidents can and do occur often. In this paper, aiming at how to hide location privacy and meanwhile provide an accurate search for LBS, we design a new geometric searchable encryption scheme under a public-key system (a.k.a. asymmetric system) for different types of geometric range queries, which enables the service provider to respond to the range queries from users accurately without learning the information about users' location. Towards this goal, we first exploit a novel encoding, and then develop some sophisticated transformations in combination with a special pairing function, which eventually converts different types of geometric range queries in LBS into different inner product problems. Finally, we present our construction by virtue of the techniques above with the inner product encryption technique. In addition, a comprehensive experimental analysis running on a specific application of privacy-preserving LBS and comparison demonstrate, our proposal is able to guarantee a higher accuracy for users' range queries without any false positive, and meanwhile express richer queries. Furthermore, we show another application of our proposal to privacy-preserving remote medical diagnosis at the end of this paper.