Lei Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lei Wu has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Hao Wang
Shandong Normal University
16 shared publications - Weizhi Meng
Lancaster University
9 shared publications - Ye Su
Shandong Normal University
9 shared publications Hao Wang
School of Information Science and Engineering, Shandong Normal University, Jinan 250307, China
5 shared publications- Rongxing Lu
Faculty of Computer Science, University of New Brunswick, Fredericton, NB, Canada
5 shared publications - Xiaochao Wei
Shandong Normal University
5 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24724-24738
A Distributed Framework for Anonymous Authentication and Secure Computation Services in Vehicular Networks
To address security risks such as single point of failure caused by traditional trusted authority, this paper proposes a distributed anonymous authentication scheme. This scheme not only ensures anonymous authentication for vehicle users to protect their privacy but also supports full traceability. Authorized vehicles can access corresponding computation services once authenticated. Specifically, to prevent single point of failure, a distributed architecture is adopted where two entities replace a single center, ensuring that neither party can perform anonymous authentication or tracing alone. Through secure collaboration between the servers, along with a commitment mechanism and elliptic curve cryptography, the anonymity of vehicle users is reliably maintained. Secondly, the scheme has a dual verification mechanism: the vehicle first passes cloud authentication, and the verified vehicle can enjoy the secure computing services provided by two clouds. If necessary, legitimate vehicles can also undergo identity verification to ensure normal communication between them. Through theoretical analysis and experimental verification, the security and feasibility of the scheme have been demonstrated. The quick reconnection mechanism we established reduces re authentication time costs by roughly 53 percent, while the dual server architecture supports privacy computing for vehicles after authentication.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24724-24738
A Distributed Framework for Anonymous Authentication and Secure Computation Services in Vehicular Networks
To address security risks such as single point of failure caused by traditional trusted authority, this paper proposes a distributed anonymous authentication scheme. This scheme not only ensures anonymous authentication for vehicle users to protect their privacy but also supports full traceability. Authorized vehicles can access corresponding computation services once authenticated. Specifically, to prevent single point of failure, a distributed architecture is adopted where two entities replace a single center, ensuring that neither party can perform anonymous authentication or tracing alone. Through secure collaboration between the servers, along with a commitment mechanism and elliptic curve cryptography, the anonymity of vehicle users is reliably maintained. Secondly, the scheme has a dual verification mechanism: the vehicle first passes cloud authentication, and the verified vehicle can enjoy the secure computing services provided by two clouds. If necessary, legitimate vehicles can also undergo identity verification to ensure normal communication between them. Through theoretical analysis and experimental verification, the security and feasibility of the scheme have been demonstrated. The quick reconnection mechanism we established reduces re authentication time costs by roughly 53 percent, while the dual server architecture supports privacy computing for vehicles after authentication.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5381-5393
SAPP: Achieving Semantic-Aware Differential Privacy for Spatiotemporal Trajectory Data Publishing
With the increasing availability of large-scale spatiotemporal data from location-based services, trajectory publishing has become essential for data-driven analysis and intelligent applications. However, insufficient protection of trajectory location data may result in the disclosure of user privacy and social relationship information. To address this issue, we propose a semantic-aware privacy-preserving trajectory data publishing scheme (SAPP). First, a sliding-window algorithm is employed to extract stay points as key semantic locations and to generate a uniformly sampled set of candidate obfuscation points. Then, a semantic-aware scoring function is designed to probabilistically select candidate points that preserve semantics while avoiding sensitive regions. Furthermore, SAPP computes the sensitivity of each location based on semantic frequency and dynamically allocates the privacy budget. Finally, random noise is added to candidate trajectories using the Laplace mechanism. Through a dual-perturbation mechanism, spatial correlations in sensitive regions are weakened. Security analysis and experimental results further demonstrate that, compared with existing approaches, SAPP reduces TPPS and SFRR by up to 18% and 14%, respectively, indicating stronger resistance against trajectory inference and semantic leakage attacks while maintaining high data utility and time efficiency.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5381-5393
SAPP: Achieving Semantic-Aware Differential Privacy for Spatiotemporal Trajectory Data Publishing
With the increasing availability of large-scale spatiotemporal data from location-based services, trajectory publishing has become essential for data-driven analysis and intelligent applications. However, insufficient protection of trajectory location data may result in the disclosure of user privacy and social relationship information. To address this issue, we propose a semantic-aware privacy-preserving trajectory data publishing scheme (SAPP). First, a sliding-window algorithm is employed to extract stay points as key semantic locations and to generate a uniformly sampled set of candidate obfuscation points. Then, a semantic-aware scoring function is designed to probabilistically select candidate points that preserve semantics while avoiding sensitive regions. Furthermore, SAPP computes the sensitivity of each location based on semantic frequency and dynamically allocates the privacy budget. Finally, random noise is added to candidate trajectories using the Laplace mechanism. Through a dual-perturbation mechanism, spatial correlations in sensitive regions are weakened. Security analysis and experimental results further demonstrate that, compared with existing approaches, SAPP reduces TPPS and SFRR by up to 18% and 14%, respectively, indicating stronger resistance against trajectory inference and semantic leakage attacks while maintaining high data utility and time efficiency.
- Open Access
- 27 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1474
TD-RCRF: A Privacy-Preserving Truth Discovery Resistant to Collusion and Reputation Fraud in Mobile Crowdsensing
Privacy-preserving truth discovery (PPTD) has garnered significant attention in mobile crowdsensing (MCS). However, existing research lacks sufficient privacy protection and is often vulnerable to collusion attacks among malicious participants. Moreover, incorrect data submitted by unreliable users and their weights may reduce the accuracy of truth discovery. To address these issues, this paper proposes a privacy-preserving truth discovery framework resistant to collusion and reputation fraud (TD-RCRF) that is highly resistant to collusion and reputation fraud. The scheme employs additive secret sharing to protect sensing data, weights, intermediate results, and ground truth. To screen trustworthy users who meet reputation requirements under the non-colluding dual-server model, we propose a privacy-preserving reputation verification algorithm that combines Pedersen commitment and zero-knowledge proof to verify the validity of mobile users’ reputation values. Additionally, we propose a homomorphic strategy that converts shares between multiplication and addition and use it to design a lightweight truth discovery algorithm that further improves the accuracy of the “truth” using reputation values. Security analysis proves that TD-RCRF is privacy-preserving and secure under the non-colluding dual-server assumption. Theoretical analysis and experiments show that it is practical and efficient.
- 27 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1474
Open AccessTD-RCRF: A Privacy-Preserving Truth Discovery Resistant to Collusion and Reputation Fraud in Mobile Crowdsensing
Privacy-preserving truth discovery (PPTD) has garnered significant attention in mobile crowdsensing (MCS). However, existing research lacks sufficient privacy protection and is often vulnerable to collusion attacks among malicious participants. Moreover, incorrect data submitted by unreliable users and their weights may reduce the accuracy of truth discovery. To address these issues, this paper proposes a privacy-preserving truth discovery framework resistant to collusion and reputation fraud (TD-RCRF) that is highly resistant to collusion and reputation fraud. The scheme employs additive secret sharing to protect sensing data, weights, intermediate results, and ground truth. To screen trustworthy users who meet reputation requirements under the non-colluding dual-server model, we propose a privacy-preserving reputation verification algorithm that combines Pedersen commitment and zero-knowledge proof to verify the validity of mobile users’ reputation values. Additionally, we propose a homomorphic strategy that converts shares between multiplication and addition and use it to design a lightweight truth discovery algorithm that further improves the accuracy of the “truth” using reputation values. Security analysis proves that TD-RCRF is privacy-preserving and secure under the non-colluding dual-server assumption. Theoretical analysis and experiments show that it is practical and efficient.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (6) , 12311-12321
QSDA: Quality-Aware Secure Multidimensional Data Aggregation With Location Privacy for HIoT
Data aggregation, as a data processing technique, facilitates accurate diagnosis in the Healthcare Internet of Things (HIoT) by integrating multi-source heterogeneous health data. However, achieving efficient and secure aggregation of multi-dimensional medical data remains challenging, particularly when simultaneously preserving location privacy and providing fair, quality-driven incentives. To address these issues, this paper proposes a Quality-Aware Secure Multi-Dimensional Data Aggregation scheme with Location Privacy for HIoT (QSDA). First, the scheme employs inner product encryption to support aggregation task matching without revealing users’ actual coordinates, and further integrates symmetric homomorphic encryption with super-increasing sequences to enable one-stop compressed aggregation of multi-dimensional data, thereby effectively supporting common statistical operations such as mean and variance. Second, it introduces a data quality incentive mechanism based on offset metrics, while leveraging blockchain auditing to ensure the traceability of the aggregation process and the verifiability of the aggregation results. Finally, security analysis and performance evaluation demonstrate the scheme’s effectiveness and efficiency.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (6) , 12311-12321
QSDA: Quality-Aware Secure Multidimensional Data Aggregation With Location Privacy for HIoT
Data aggregation, as a data processing technique, facilitates accurate diagnosis in the Healthcare Internet of Things (HIoT) by integrating multi-source heterogeneous health data. However, achieving efficient and secure aggregation of multi-dimensional medical data remains challenging, particularly when simultaneously preserving location privacy and providing fair, quality-driven incentives. To address these issues, this paper proposes a Quality-Aware Secure Multi-Dimensional Data Aggregation scheme with Location Privacy for HIoT (QSDA). First, the scheme employs inner product encryption to support aggregation task matching without revealing users’ actual coordinates, and further integrates symmetric homomorphic encryption with super-increasing sequences to enable one-stop compressed aggregation of multi-dimensional data, thereby effectively supporting common statistical operations such as mean and variance. Second, it introduces a data quality incentive mechanism based on offset metrics, while leveraging blockchain auditing to ensure the traceability of the aggregation process and the verifiability of the aggregation results. Finally, security analysis and performance evaluation demonstrate the scheme’s effectiveness and efficiency.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 2551-2568
SecOIR: Enhancing Privacy and Accuracy in Outsourced Image Retrieval via Function Secret Sharing and Deep Hashing
With the increasing prevalence of outsourcing images to cloud servers, privacy-preserving content-based image retrieval (CBIR) has attracted significant research attention. Existing privacy-preserving CBIR schemes often prioritize retrieval speed by adopting methods that provide weak privacy guarantees and low-dimensional image features, which inevitably compromises security and retrieval accuracy. Additionally, most solutions directly employ CNN models pre-trained on public datasets for feature extraction, neglecting domain adaptation problem. To address these limitations, we propose SecOIR, a secure outsourced image retrieval scheme based on deep hashing networks, which achieves provable security under the semi-honest adversary model while hiding access patterns. Furthermore, domain adaptation is resolved through fine-tuning of feature extraction models. Experimental results demonstrate that SecOIR outperforms state-of-the-art schemes by 11%-12% in accuracy under identical datasets and configurations, while maintaining practical efficiency. To achieve SecOIR, we propose two modified function secret sharing (FSS) schemes that overcome the limited compatibility of the original FSS schemes with replicated secret sharing (RSS). Then, building upon the modified FSS schemes and RSS, we design a series of efficient sub-protocols. Benchmark tests reveal that our sub-protocols surpass existing mainstream solutions in efficiency, which can also serve as independent contributions to secure multi-party computation protocol design.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 2551-2568
SecOIR: Enhancing Privacy and Accuracy in Outsourced Image Retrieval via Function Secret Sharing and Deep Hashing
With the increasing prevalence of outsourcing images to cloud servers, privacy-preserving content-based image retrieval (CBIR) has attracted significant research attention. Existing privacy-preserving CBIR schemes often prioritize retrieval speed by adopting methods that provide weak privacy guarantees and low-dimensional image features, which inevitably compromises security and retrieval accuracy. Additionally, most solutions directly employ CNN models pre-trained on public datasets for feature extraction, neglecting domain adaptation problem. To address these limitations, we propose SecOIR, a secure outsourced image retrieval scheme based on deep hashing networks, which achieves provable security under the semi-honest adversary model while hiding access patterns. Furthermore, domain adaptation is resolved through fine-tuning of feature extraction models. Experimental results demonstrate that SecOIR outperforms state-of-the-art schemes by 11%-12% in accuracy under identical datasets and configurations, while maintaining practical efficiency. To achieve SecOIR, we propose two modified function secret sharing (FSS) schemes that overcome the limited compatibility of the original FSS schemes with replicated secret sharing (RSS). Then, building upon the modified FSS schemes and RSS, we design a series of efficient sub-protocols. Benchmark tests reveal that our sub-protocols surpass existing mainstream solutions in efficiency, which can also serve as independent contributions to secure multi-party computation protocol design.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (2) , 544-559
PPSKSQ: Towards Efficient and Privacy-Preserving Spatial Keyword Similarity Query in Cloud
The growth of cloud computing has led to the widespread use of location-based services, such as spatial keyword queries, which return spatial data points within a given range that have the highest similarity in keyword sets to the user's. As the volume of spatial data increases, providers commonly outsource data to powerful cloud servers. Because cloud servers are untrustworthy, privacy-preserving keyword query schemes have been proposed. However, existing schemes consider only location queries or exact keyword matching. To address these issues, we propose the Privacy-Preserving Spatial Keyword Similarity Query Scheme (PPSKSQ), designed to search for spatial data points with the highest similarity while protecting the privacy of outsourced data, query requests, and results. First, we design two sub-protocols based on improved symmetric homomorphic encryption (iSHE): iSHE-SC for secure size comparison and iSHE-SIP for secure inner product computation. Then, we encode range information and integrate it with a quadtree to construct a novel index structure. Additionally, we use the Jaccard to measure similarity in conjunction with the iSHE-SC protocol, transforming similarity comparison into a matrix trace operation. Finally, rigorous security analysis and extensive simulation experiments confirm the flexibility, efficiency, and scalability of our scheme.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (2) , 544-559
PPSKSQ: Towards Efficient and Privacy-Preserving Spatial Keyword Similarity Query in Cloud
The growth of cloud computing has led to the widespread use of location-based services, such as spatial keyword queries, which return spatial data points within a given range that have the highest similarity in keyword sets to the user's. As the volume of spatial data increases, providers commonly outsource data to powerful cloud servers. Because cloud servers are untrustworthy, privacy-preserving keyword query schemes have been proposed. However, existing schemes consider only location queries or exact keyword matching. To address these issues, we propose the Privacy-Preserving Spatial Keyword Similarity Query Scheme (PPSKSQ), designed to search for spatial data points with the highest similarity while protecting the privacy of outsourced data, query requests, and results. First, we design two sub-protocols based on improved symmetric homomorphic encryption (iSHE): iSHE-SC for secure size comparison and iSHE-SIP for secure inner product computation. Then, we encode range information and integrate it with a quadtree to construct a novel index structure. Additionally, we use the Jaccard to measure similarity in conjunction with the iSHE-SC protocol, transforming similarity comparison into a matrix trace operation. Finally, rigorous security analysis and extensive simulation experiments confirm the flexibility, efficiency, and scalability of our scheme.
- 25 January 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 89
Privacy-preserving and verifiable multi-task data aggregation for IoT-based healthcare
- 25 January 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 89
Privacy-preserving and verifiable multi-task data aggregation for IoT-based healthcare
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (4) , 5856-5870
SCTP: Achieving Semantic Correlation Trajectory Privacy-Preserving With Differential Privacy
With the rapid proliferation of vehicular technology, location-based services (LBS) have become a crucial component of Internet of Vehicles (IoV) applications, such as map navigation and health tracking. These applications rely on users' location information to provide services, enabling users to effectively share their locations, access information about nearbyactivities, and engage in real-time communication. However, the extensive collection and sharing of location data pose serious challenges to the semantic privacy preservation of user locations. To address these challenges in IoV, we propose a Semantic Correlation Trajectory Privacy-Preserving mechanism (SCTP). The SCTP combines the Hidden Markov Models (HMM) with differential privacy, aiming to protect the semantic privacy of user trajectory locations while maintaining high-quality location services and data usability. Our scheme introduces a trajectory prediction algorithm based on HMM, which dynamically and accurately predicts user trajectories and generates highly available semantically correlated trajectory datasets. Additionally, we design a personalized privacy budget allocation strategy based on semantic frequency. By assigning privacy weights, we significantly improve the usability of trajectory data while protecting data privacy. Theoretical analysis and experimental validation demonstrate that SCTP rigorously adheres to $\varepsilon$ -differential privacy standards while exhibiting significant advantages in safeguarding the semantic privacy of user locations.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (4) , 5856-5870
SCTP: Achieving Semantic Correlation Trajectory Privacy-Preserving With Differential Privacy
With the rapid proliferation of vehicular technology, location-based services (LBS) have become a crucial component of Internet of Vehicles (IoV) applications, such as map navigation and health tracking. These applications rely on users' location information to provide services, enabling users to effectively share their locations, access information about nearbyactivities, and engage in real-time communication. However, the extensive collection and sharing of location data pose serious challenges to the semantic privacy preservation of user locations. To address these challenges in IoV, we propose a Semantic Correlation Trajectory Privacy-Preserving mechanism (SCTP). The SCTP combines the Hidden Markov Models (HMM) with differential privacy, aiming to protect the semantic privacy of user trajectory locations while maintaining high-quality location services and data usability. Our scheme introduces a trajectory prediction algorithm based on HMM, which dynamically and accurately predicts user trajectories and generates highly available semantically correlated trajectory datasets. Additionally, we design a personalized privacy budget allocation strategy based on semantic frequency. By assigning privacy weights, we significantly improve the usability of trajectory data while protecting data privacy. Theoretical analysis and experimental validation demonstrate that SCTP rigorously adheres to $\varepsilon$ -differential privacy standards while exhibiting significant advantages in safeguarding the semantic privacy of user locations.
- 18 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 4397-4410
Towards Auditable and Privacy-Preserving Online Medical Diagnosis Service Over Cloud
While online medical diagnosis provides significant convenience to users, it also incurs the risk of privacy breaches, which inspired the emergence of various privacy-preserving online medical schemes. Nonetheless, existing schemes either compromise partial privacy to third parties or rely on cryptographic methods with high computational complexity. In particular, they do not anticipate user's disputes to the extent that there is no audit process to guarantee the correctness of the diagnosis results and the fairness of the schemes. Consequently, we propose an efficient and privacy-preserving online medical diagnosis scheme based on additive secret sharing (ASS). First, the anonymity of the user is provided in the medical diagnosis process, which ensures that the cloud cannot link the diagnosis results to the user. Then, we devise a minimum value protocol and a range comparison protocol to enhance the security of the online diagnosis. In addition, considering user's disputes that arise in realistic scenarios (e.g., malicious users may cheat the diagnosis system for personal benefits), we construct a blockchain-based audit process to detect user's behaviors and settle controversies. Finally, we demonstrate the security and efficiency of the proposed scheme with theoretical analysis and experimental evaluation.
- 18 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 4397-4410
Towards Auditable and Privacy-Preserving Online Medical Diagnosis Service Over Cloud
While online medical diagnosis provides significant convenience to users, it also incurs the risk of privacy breaches, which inspired the emergence of various privacy-preserving online medical schemes. Nonetheless, existing schemes either compromise partial privacy to third parties or rely on cryptographic methods with high computational complexity. In particular, they do not anticipate user's disputes to the extent that there is no audit process to guarantee the correctness of the diagnosis results and the fairness of the schemes. Consequently, we propose an efficient and privacy-preserving online medical diagnosis scheme based on additive secret sharing (ASS). First, the anonymity of the user is provided in the medical diagnosis process, which ensures that the cloud cannot link the diagnosis results to the user. Then, we devise a minimum value protocol and a range comparison protocol to enhance the security of the online diagnosis. In addition, considering user's disputes that arise in realistic scenarios (e.g., malicious users may cheat the diagnosis system for personal benefits), we construct a blockchain-based audit process to detect user's behaviors and settle controversies. Finally, we demonstrate the security and efficiency of the proposed scheme with theoretical analysis and experimental evaluation.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (1) , 419-434
Privacy-Preserving Machine Learning in Cloud–Edge–End Collaborative Environments
We propose a privacy-preserving machine learning scheme based on the cloud-edge–end architecture to address issues like weak computing power of Internet of Things (IoT) terminals, poor communication quality, and heavy cloud server burdens in traditional frameworks. Edge servers aggregate and forward terminal data, relieving terminals of heavy communication tasks and undertaking part of the computing tasks, which reduces the burden on cloud servers and improves system response speed. For privacy protection, we flexibly use homomorphic encryption and secret sharing techniques, and dynamically add differential privacy noise to resist member inference attacks. Task allocation is coordinated between different layers to optimize computing overhead. Shallow model training is performed on edge servers using homomorphic encryption, while deep model training is conducted on cloud servers using secret sharing. To achieve the conversion from homomorphic ciphertext to secret sharing shares, we design a distributed decryption protocol. Experimental results show our scheme reduces computation overhead by 20%–30% compared to existing privacy-preserving machine learning schemes based on the cloud-edge–end framework, while maintaining privacy protection throughout all stages.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (1) , 419-434
Privacy-Preserving Machine Learning in Cloud–Edge–End Collaborative Environments
We propose a privacy-preserving machine learning scheme based on the cloud-edge–end architecture to address issues like weak computing power of Internet of Things (IoT) terminals, poor communication quality, and heavy cloud server burdens in traditional frameworks. Edge servers aggregate and forward terminal data, relieving terminals of heavy communication tasks and undertaking part of the computing tasks, which reduces the burden on cloud servers and improves system response speed. For privacy protection, we flexibly use homomorphic encryption and secret sharing techniques, and dynamically add differential privacy noise to resist member inference attacks. Task allocation is coordinated between different layers to optimize computing overhead. Shallow model training is performed on edge servers using homomorphic encryption, while deep model training is conducted on cloud servers using secret sharing. To achieve the conversion from homomorphic ciphertext to secret sharing shares, we design a distributed decryption protocol. Experimental results show our scheme reduces computation overhead by 20%–30% compared to existing privacy-preserving machine learning schemes based on the cloud-edge–end framework, while maintaining privacy protection throughout all stages.