Private Set Intersection (PSI) is typically used to achieve ID alignment with protection of IDs in the preparation phase of Vertical Federated Learning (VFL). However, existing PSI approaches are limited to protecting IDs that are outside the intersection of participants, and most ignore the sensitivity of intersection for a weak party in an asymmetrical ID alignment. Since the set size of the strong party is much greater than the weak party’s in an asymmetrical federation, and the intersection usually accounts for a substantial part of the weak party set, the weak party’s sensitive sample IDs would be severely compromised through sharing the intersection. To address this issue, we propose Differentially private PSI Cardinality and PSI (DPSI-CA, DPSI) protocols, which protect the intersection cardinality and sensitive IDs inside the intersection for the weak party, respectively. First, DPSI-CA encodes IDs in binary notation, and combines them with the GM encryption, to perform the ID-matchmaking by executing bitwise plaintext XOR. Then, the encrypted matching results are independently perturbed using randomized responses to produce differentially private outputs for PSI-CA, and its unbiased estimate is added to remove the deviation brought by the randomization. Furthermore, DPSI fuses Pseudo-Random Function (PRF)-based zero sharing, garbled Bloom filter, and Oblivious PRF (OPRF)-based shares reconstruction, to successfully reconstruct the shares corresponding to sampled IDs in the intersection. Meanwhile, a randomized response is used to sample the inputs and perturb the outputs of the OPRF-based shares reconstruction, producing a randomly sampled intersection for the weak party and differentially private intersection for the strong party. Finally, the privacy analysis shows that our protocols provide differential privacy for the weak party’s sensitive sample IDs, and extensive experiment results illustrate the feasibility of the asymmetrical ID alignment involving millions of IDs.
12 September 2023 in IEEE Internet of Things Journal
Artificial Intelligence of Things (AIoT) is an emerging paradigm that integrates artificial intelligence (AI) and Internet of Things (IoT) technologies to provide intelligent IoT solutions. The AIoT system acquires data in real time through IoT sensors, performs intelligent data analysis tasks anywhere in the terminal–edge–cloud continuum, and provides accurate decision-making services based on data predictions. Cloud–edge collaboration can reduce security risks for AIoT data prediction by sharing data features instead of raw data. However, sensitive user data may still be inferred by attackers through model parameter analysis, causing irreparable harm and serious consequences. Therefore, data prediction based on cloud–edge collaboration while maintaining privacy constraints remains a significant challenge. In this article, a differentially private federated tensor completion method is proposed for cloud–edge collaborative AIoT data prediction. This method embeds differential privacy (DP) mechanisms with cloud–edge collaboration. Each edge is capable of processing and analyzing data, and collaborative learning with other edges by sharing privacy-preserving model parameters. For model security, objective perturbation is applied to ensure that the tensor completion method satisfies DP. To achieve higher accuracy, parallel tensor decomposition is introduced to avoid the update conflicts problem of federated tensor completion. Through theoretical analysis, our method can provide data protection for tensor completion with high-security promise. The experiments are performed on both synthetic and real-world data sets to demonstrate the superior performance of our method in preserving data privacy.
26 August 2025 in IEEE Transactions on Mobile Computing
Edge-assisted Hierarchical Federated Learning (EHFL) accelerates global model training across mobile devices by hierarchically aggregating models. However, EHFL encounters critical challenges such as privacy risks for local and edge-level models, vulnerability to collusive Byzantine attacks, and issues with model diversity and heterogeneity due to Non-Independent and Identically Distributed (Non-IID) data. In this paper, we propose PPBR, a novel hybrid scheme that subtly integrates Condensed Local Differential Privacy (CLDP) and Packed Linearly Homomorphic Encryption (PLHE) to achieve strong privacy protection and resilience against various Byzantine attacks in Non-IID data scenarios. Specifically, PPBR clusters the sign statistics of local models and clips the norms of edge-level momenta to filter anomalous models and mitigate Byzantine faults while retaining diverse models coming from Non-IID data. To enhance privacy protection with acceptable accuracy loss, the sign tuples of local models are perturbed with CLDP guarantees, and the momenta of edge-level models are encrypted under PLHE. Meanwhile, PPBR enhances privacy in single-edge-server and single-cloud-server aggregations by using random perturbations, secret sharing, and PLHE. In addition to safeguarding privacy with accommodating abrupt dropouts of mobile devices and edge servers, the aggregations effectively mitigate the adverse effects of Non-IID data under advanced Byzantine attacks. Theoretical analysis and comprehensive experiments validate PPBR’s strong privacy guarantees and resilience to various Byzantine attacks under Non-IID data.
9 May 2025 in IEEE Transactions on Mobile Computing
Multi-dimensional range queries performed on the mobile user data records become increasingly important and popular in the fields of e-commerce, social media, transportation logistics, etc. Meanwhile, mobile users usually have different privacy requirements for different attributes of the records. A straightforward and effective approach is to first get low-dimensional range query outcomes by using existing LDP mechanisms at different privacy levels, and then derive high-dimensional range query results at each level, and finally aggregate the results from all levels. However, it incurs low utility of the query results, since the non-fixed privacy budgets and the correlation between dimensions (attributes) detrimentally impact the utility of LDP methods, ultimately rendering them ineffective in practice. In this paper, we propose a new Personalized LDP approach for Multi-dimensional Range queries (PLDP-MR) over mobile user data, consisting of the user grouping, data perturbing, data re-perturbing, and range query results aggregating steps. First, PLDP-MR offers flexible dual grouping based on user-selected privacy levels and relevant attributes to obtain the corresponding one-dimensional and two-dimensional grids. PLDP-MR optimizes the grid granularity to minimize errors from perturbing users' attribute data with different LDP noises at non-fixed privacy levels. Furthermore, PLDP-MR carefully re-perturbs the LDP-noisy data from mobile users at lower privacy levels (i.e., having the higher utility) to achieve LDP with higher privacy levels and supplement the data volume of the corresponding groups. Thus, the data utility is effectively improved without additional privacy losses. Finally, PLDP-MR aggregates the frequencies in all the one-dimensional and two-dimensional grids related to the multi-dimensional range query at all query intervals and all privacy levels to derive the final query result with considering the correlation between attributes. The aggregations use maximum entropy optimization and maximum likelihood methods to further enhance its utility. The privacy and utility of PLDP-MR are analyzed, and extensive experiments demonstrate its effectiveness.
19 August 2024 in IEEE Transactions on Consumer Electronics
Anomalies within data flows in the Internet of Things environment can potentially result in security vulnerabilities in consumer electronics. Therefore, it is crucial to effectively detect anomaly data to safeguard the reliability and continuous functionality of consumer electronics. Existing related works either learn from unlabeled data using unsupervised methods or leverage the limited labeled data to improve detection performance by semi-supervised methods. However, these methods usually overfit specific types of known anomalies or ignore the uncertainty when model training. To this end, we design a novel approach to jointly optimize the end-to-end detection of labeled and unlabeled anomalies. Specifically, the anomaly data detection problem investigated is first reformulated as a Markov decision process. Then, a partially labeled anomaly data detection approach (PANDA) based on prioritized deep deterministic policy gradient is proposed, which considers uncertainty when the agent makes decisions and can learn from the labeled known anomalies while continuously exploring and detecting prospective anomalies in unlabeled data. Extensive experiments on 13 datasets show that PANDA improves the AUC-ROC and AUC-PR by 3.0%-10.3% and 10.0%-73.5% and its robustness under the impact of anomaly contamination rates compared with four state-of-the-art competing methods.