Mobile users often prefer to sense only a subset of tasks based on their preferences or physical conditions, which distinguishes sparse crowdsensing from traditional crowdsensing. Sparse crowdsensing not only introduces a potential risk of privacy leakage regarding users’ preferences or conditions—due to the revelation of specific sensed objects—but also results in reduced accuracy of truth estimation. To address these challenges, we propose a Privacy-Preserving Truth Discovery (PPTD) scheme, named S-PPTD, that enables accurate and efficient PPTD for sparse crowdsensing. Our approach leverages edge nodes to geographically group users and introduces an effective padding strategy based on Bloom filters and mixed secret sharing. This strategy allows users to obfuscate the objects they sense, preventing adversaries from determining the specific objects being sensed. To improve accuracy, we design new protocols for precise and efficient approximation of nonlinear functions, enabling the use of commonly applied kernel functions to capture spatial and temporal correlations between objects, and incorporate these into the truth estimation process. Through extensive experiments and security analysis, we demonstrate that S-PPTD is secure, accurate, and efficient in the context of sparse mobile crowdsensing.

Clustering is a crucial unsupervised machine learning algorithm extensively used in various practical applications, such as patient refinement and fraud detection, which often involve vertically distributed data across multiple data centers. However, sharing datasets directly is typically prohibited under GDPR due to potential privacy breaches. Therefore, privacy-preserving joint clustering for vertically distributed datasets is highly desired. In this paper, we propose Privacy-Preserving Vertically Federated Clustering (PPVFC), a solution that not only achieves this goal but also significantly reduces computational and communication overhead for each data owner (DO). Unlike most previous works that achieve the goal with a single privacy-enhancing technology, PPVFC jointly leverages multiparty homomorphic encryption (MHE) and multiparty computation (MPC) to efficiently interleave communication-lightweight homomorphic computations on the local dataset with operations over collectively secret-shared intermediate data. Specifically, we design a coefficient-wise encoding for MHE to pack large datasets and minimize communication costs. Additionally, we develop a round-efficient bit extraction protocol for determining the minimum distance. Through extensive experiments and security analysis, we demonstrate the practical performance and robust security guarantees of PPVFC.

Privacy-preserving statistical analysis enables the data center to analyze datasets from multiple data owners, extracting valuable insights while safeguarding privacy. However, the observation of microdata involvement in various analysis tasks within the data center can indirectly lead to privacy breaches. For instance, when the data center observes microdata involved in a disease-related task, it may reveal information about the corresponding user’s disease. Existing schemes process the entire dataset for each analysis task to prevent privacy breaches, resulting in significant redundancy overhead due to the large amount of task-irrelevant data involved in processing. In this paper, we propose FDC, which can protect privacy and effectively reduce the redundancy overhead. It frees the data center from huge redundancy overhead. Specifically, we propose a co-design of local differential privacy and multiparty computation with preprocessing by the data owner. This design enables the data center to process only task-relevant and LDP noise-induced microdata instead of the entire dataset while maintaining analysis results without accuracy loss. In some scenarios where preprocessing by the data owner is unfeasible, we present a data center-assisted method to complete preprocessing within the data center. Additionally, we design and optimize a secure shuffle protocol within this method. Finally, we implement and evaluate FDC using the aggregation task as a baseline. With different proportions of task-relevant microdata, experimental results show that the runtime of FDC is 2~11x faster than existing schemes on LAN and 2~22x on WAN, and the communication overhead is up to 3~153x lower.

Truth discovery is an effective tool to infer true information from multi-source data and has been widely applied in mobile crowdsensing systems. In some specific scenarios, the sensory data are collected in a streaming fashion with time-varying information, and the server should update the truth in time. Under such circumstances, local differential privacy-based mechanism can satisfy the requirement of real-time processing properly while keeping the privacy of sensory data. However, directly applying local differential privacy to handle streaming data will disclose the long-term potential privacy and decrease the accuracy. To address these problems, we propose an incentive-based privacy-preserving truth discovery framework over streaming data. Firstly, we adopt the sequential composition theorem of w-event privacy to protect workers' long-term privacy. Second, we design an incentive mechanism to improve the submitted data utility and thus avoid the decrease in accuracy. In this way, our scheme ensures that workers submit more accurate data while their global privacy is still guaranteed. Finally, we prove our scheme satisfies w-event (∊, δ) differential privacy and theoretically analyze the result utility. Extensive experiments also demonstrate the effectiveness of our incentive mechanism.

Recently, there have been many discussions in mobile crowd-sensing about privacy-preserving truth discovery because of its ability to extract truthful information from noisy or biased sensory data without privacy breaches. However, in practical applications, users (referred to as workers) may report outliers due to device malfunction, malicious workers, etc. These outliers will dramatically impact the accuracy of the truth discovery result. Detecting outliers based on existing privacy preservation schemes will carry an intolerable overhead, dramatically reducing the system's availability. In this paper, we propose our privacy-preserving truth discovery scheme that can detect outliers. Specifically, we adopt an anonymous mechanism to achieve privacy preservation. Since the existing anonymous mechanisms require huge overhead and do not work correctly when some workers exit, they are difficult to be applied in mobile crowdsensing systems. We design a lightweight and robust anonymous mechanism based on the edge computing paradigm. In addition, we eliminate the impact of outliers through outlier detection to achieve robustness of truth discovery results. Finally, we demonstrate the security of our scheme through security analysis and the efficiency of our scheme in terms of computation and communication overhead through extensive experiments.

Truth discovery is an effective method to infer truthful information from a large amount of sensory data in mobile crowdsensing systems. Privacy-preserving truth discovery schemes require the cloud server not to access each worker's sensory data directly so that the privacy of sensory data can be preserved. In some specific applications such as sparse mobile crowdsensing, workers can only contribute sensory data on a small part of sensing tasks, implying that the information of which tasks are completed by a worker should also be preserved. However, existing privacy-preserving truth discovery schemes do not consider such sparse data scenarios in mobile crowdsensing systems. In this paper, we first identify the privacy issues in truth discovery when sensory data are sparse. To address these issues, we design a privacy-preserving truth discovery scheme by employing the additively homomorphic cryptosystem and additive secret sharing with two non-colluding servers. Through detailed analysis and extensive experiments, we demonstrate that our proposed scheme can satisfy strong privacy-preserving requirements with low computation and communication overhead.

With the proliferation of mobile and wearable devices, mobile crowdsensing (MCS) is becoming a new paradigm for data collection and analysis. To effectively identify truthful information from crowdsensed data without privacy leakage, privacy-preserving truth discovery (PPTD) has gained much attention recently. Existing works either didn't consider real-time applications over data streams or failed to achieve enough efficiency for a large group of workers. In this paper, we propose FPTD, a Fog-aided Privacy-preserving Truth Discovery framework which is secure and efficient in handling real-time applications with a large group of workers. To reduce overhead, we adopt cloud-fog computing architecture to divide the complete worker group into many smaller ones. Then we design a unique secure aggregation protocol SecAgg which can securely and efficiently aggregate inputs from workers in smaller groups. Finally, we give detailed construction of FPTD, an efficient truth discovery framework based on SecAgg for real-time applications. Through extensive experiments and security analysis, we demonstrate that both SecAgg and FPTD are secure and efficient.